-free Graphs in Polynomial Time.
Akanksha AgrawalPaloma T. LimaDaniel LokshtanovPawel RzazewskiSaket SaurabhRoohani SharmaPublished in: CoRR (2024)
Keyphrases
- graph isomorphism
- polynomial time complexity
- special case
- bounded treewidth
- np complete
- planar graphs
- computational complexity
- graph matching
- graph theoretic
- graph databases
- graph representation
- graph partitioning
- graph theory
- worst case
- data sets
- series parallel
- weighted graph
- finite automata
- bipartite graph
- directed graph
- structured objects
- search engine