Pathwidth of cubic graphs and exact algorithms

2005/11/29 by Fedor V. Fomin, Kjartan Høie · 7 citations
Computer Science · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Interconnection Networks and Systems

paper · doi:10.1016/j.ipl.2005.10.012

openalex publication_date 2005/11/29 · crossref created 2005/11/29 · crossref issued 2006/03/01 · crossref published 2006/03/01 · crossref published-print 2006/03/01 · crossref deposited 2019/04/08 · crossref indexed 2024/03/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Citations

• Which Problems Have Strongly Exponential Complexity?

Cited by

• Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
• Algorithms Based on the Treewidth of Sparse Graphs
• Improved Exact Algorithms for Counting 3- and 4-Colorings
• Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
• Improved edge-coloring with three colors
• Inclusion/Exclusion Meets Measure and Conquer
• List of unsolved problems in mathematics [wikipedia]
• Pathwidth [wikipedia]