Certifying induced subgraphs in large graphs
From MaRDI portal
Publication:6636998
DOI10.7155/jgaa.v28i3.2971MaRDI QIDQ6636998
Hung Tuan Tran, Konstantinos Tsakalidis, Ulrich Meyer
Publication date: 12 November 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certifying algorithms
- Certifying 3-edge-connectivity
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
- The splittance of a graph
- The buffer tree: A technique for designing batched external data structures
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- Incidence matrices and interval graphs
- A simple certifying algorithm for 3-edge-connectivity
- LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
- Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
- Node-Deletion Problems on Bipartite Graphs
- Efficient Planarity Testing
- On External-Memory Planar Depth First Search
- Sequential and Parallel Algorithms and Data Structures
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm
- Certifying induced subgraphs in large graphs
- An Experimental Study of External Memory Algorithms for Connected Components
This page was built for publication: Certifying induced subgraphs in large graphs
