Author:
Pardalos Panos M.,Rebennack Steffen
Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. Electronic Edition 2000;R. Diestel,2000
2. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)
3. Karp, R.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability, A guide to the Theory of NP-Completeness. In: Klee, V. (ed.) A series of books in the mathematical sciences. W. H. Freeman and Company, New York (1979)
5. Arora, S., Safra, S.: Probabilistic Checking of Proofs; a new Characterization of NP. In: Proceedings 33rd IEEE Symposium on Foundations of Computer Science, pp. 2–13. IEEE Computer Society, Los Angeles (1992)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Clique Partitioning of a Graph;Journal of Communications Technology and Electronics;2022-12
2. A Novel Deployment Method for UAV-mounted Mobile Base Stations;2021 17th International Conference on Mobility, Sensing and Networking (MSN);2021-12
3. PEAVC: An improved minimum vertex cover solver for massive sparse graphs;Engineering Applications of Artificial Intelligence;2021-09
4. Parallel Clique-Like Subgraph Counting and Listing;Conceptual Modeling;2019
5. Business Network Analytics: From Graphs to Supernetworks;Business and Consumer Analytics: New Ideas;2019