Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
DOI10.1007/s00453-022-01033-8OpenAlexW3166960035MaRDI QIDQ2684481
Petr Hliněný, Deniz Ağaoğlu Çağırıcı
Publication date: 16 February 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01495
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph isomorphism problem
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Precoloring extension. I: Interval graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Combinatorial problems on \(H\)-graphs
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
- Isomorphism testing for \(T\)-graphs in FPT
- Extending partial representations of subclasses of chordal graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- On the Cutwidth and the Topological Bandwidth of a Tree
- On testing isomorphism of permutation graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Topics in Intersection Graph Theory
- On Tractable Parameterizations of Graph Isomorphism
- Graph isomorphism in quasipolynomial time [extended abstract]
- On \(H\)-topological intersection graphs
- Recognizing Proper Tree-Graphs
This page was built for publication: Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
