scientific article; zbMATH DE number 7559375
From MaRDI portal
Publication:5089162
DOI10.4230/LIPICS.MFCS.2020.4MaRDI QIDQ5089162FDOQ5089162
Authors: Deniz Ağaoğlu, Petr Hliněný 
Publication date: 18 July 2022
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3875343
- scientific article; zbMATH DE number 3815
- scientific article; zbMATH DE number 3841910
- Graph isomorphism problem
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- Graph algebras and the graph isomorphism problem
- The isomorphism problem for classes of graphs closed under contraction
- A solution of the isomorphism problem for circulant graphs
- The graph isomorphism problem on geometric graphs
- The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
Cites Work
- Title not available (Why is that?)
- Fundamentals of parameterized complexity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Title not available (Why is that?)
- On tractable parameterizations of graph isomorphism
- Title not available (Why is that?)
- Graph isomorphism problem
- Precoloring extension. I: Interval graphs
- Graph isomorphism in quasipolynomial time (extended abstract)
- On the Cutwidth and the Topological Bandwidth of a Tree
- An improved isomorphism test for bounded-tree-width graphs
- Combinatorial problems on \(H\)-graphs
- On \(H\)-topological intersection graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089162)
