Journal Article10.1016/0020-0190(79)90130-3
Graph 2-isomorphism is NP-complete
14
TL;DR: In this note it is shown-that graph-Xsomorphism (GX), i.e., to decide whether LJ(G, G’) < 2, is an NP-complete problem.
read more
About: This article is published in Information Processing Letters. The article was published on 17 Aug 1979. The article focuses on the topics: Graph isomorphism & Graph canonization.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The NP-completeness column: An ongoing guide
TL;DR: This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson.
859
Mathematical problems and games
TL;DR: In this paper, Ulam proposed a generalization of the Suslin-Visual classes of set theory and showed that it is possible to solve the problem of infinite sequences of O's and l's with changes on sets of frequency 0.
23
Minimal decompositions of graphs into mutually isomorphic subgraphs
Fan Chung,P. Erdős,Ron Graham +2 more
TL;DR: It turns out rather unexpectedly that the leading term ofUk(n) does not depend onk, and the largest possible valueU(G) can assume whereG ranges over all sets ofk graphs havingn vertices and the same (unspecified) number of edges.
18
•Book
Graph drawing : 7th International Symposium, GD '99, Štiřín Castle, Czech Republic, September 15-19, 1999 : proceedings
Jan Kratochvíl
- 01 Jan 1999
TL;DR: The Anatomy of a Geometric Algorithm, an Heuristic for Graph Symmetry Detection and more.
10
Compact representations of all members of an independence system
Utz-Uwe Haus,Carla Michini +1 more
TL;DR: It is shown that for every independence system there exists a top-down construction rule for the BDD, and minimal widths of BDDs representing the set of all solutions to a stable set problem for various basic classes of graphs are characterized.
8
References
•Book
Graph theory
Frank Harary
- 01 Jan 1969
TL;DR: This project focuses on Tutte’s work in cryptography, which enabled the British to read high-level German army messages and has been described as one of the greatest intellectual feats of the war.
18K
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
8.7K