Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution-Reference-Cited by-同舟云学术

Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution

Published:2004 Issue: Volume: Page:411-425
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing
language:
Short-container-title:

Author:

Mneimneh Maher,Sakallah Karem

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24605-3_31

Reference18 articles.

1. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic Model Checking Using SAT Procedures instead of BDDs. In: Proceedings of the 36th Design Automation Conference (1999)

2. Lecture Notes in Computer Science;A. Biere,1999

3. Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35(8), 677–691 (1986)

4. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest Paths Algorithms: Theory and Experimental Evaluation. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (1993)

5. Labbe, M., Peeters, D., Thisse, J.-F.: Location on Networks. Handbooks in OR & MS, North-Holland, 551–624 (1995)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resistance Eccentricity in Graphs: Distribution, Computation and Optimization;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks;Asia-Pacific Journal of Operational Research;2021-02-27

3. Solving QBF with counterexample guided refinement;Artificial Intelligence;2016-05

4. 2QBF: Challenges and Solutions;Theory and Applications of Satisfiability Testing – SAT 2016;2016

5. Solving QBF with Counterexample Guided Refinement;Theory and Applications of Satisfiability Testing – SAT 2012;2012