A Linear Time Algorithm for Deciding Interval Graph Isomorphism
From MaRDI portal
Publication:4187325
DOI10.1145/322123.322125zbMath0402.68050MaRDI QIDQ4187325
George S. Lueker, Kellogg S. Booth
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/8ss2q7bp
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C99: Graph theory
Related Items
Intersection graphs of proper subtrees of unicyclic graphs, A note on compact graphs, The isomorphism problem for classes of graphs closed under contraction, On a unique tree representation for \(P_ 4\)-extendible graphs, A tree representation for \(P_ 4\)-sparse graphs, A linear-time algorithm for isomorphism of a subclass of chordal graphs, Efficient parallel recognition of some circular arc graphs. I, Simulated annealing and the mapping problem: A computational study, A fast parallel algorithm to recognize P4-sparse graphs, On the structure of graphs with few \(P_4\)s, A selected tour of the theory of identification matrices, Isomorphism of chordal (6, 3) graphs, Intersection graphs of Helly families of subtrees, Graph isomorphism and identification matrices: Sequential algorithms, Optimal greedy algorithms for indifference graphs
