Computing and listing avoidable vertices and paths
From MaRDI portal
Publication:6185944
Cites work
- scientific article; zbMATH DE number 1305489 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A new algorithm for optimal 2-constraint satisfaction and its implications
- A vertex incremental approach for maintaining chordality
- Algorithmic Aspects of Vertex Elimination on Graphs
- Avoidable paths in graphs
- Avoidable vertices and edges in graphs
- BetweenO(nm) andO(nalpha)
- Complement reducible graphs
- Computing and listing avoidable vertices and paths
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Finding a Minimum Circuit in a Graph
- Finding and counting small induced subgraphs efficiently
- Graph extremities defined by search algorithms
- Graph theory
- Maximum cardinality search for computing minimal triangulations of graphs
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Minimal triangulations of graphs: a survey
- Modular decomposition and transitive orientation
- On rigid circuit graphs
- On the complexity of \(k\)-SAT
- Separability generalizes Dirac's theorem
- Shifting paths to avoidable ones
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- The diameter of AT‐free graphs
- Vertex elimination orderings for hereditary graph classes
This page was built for publication: Computing and listing avoidable vertices and paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185944)
