Computing and listing avoidable vertices and paths
From MaRDI portal
Publication:6185944
DOI10.1007/S00453-023-01168-2OpenAlexW4386420802MaRDI QIDQ6185944FDOQ6185944
Authors: Charis Papadopoulos, Athanasios E. Zisis 
Publication date: 9 January 2024
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-023-01168-2
Cites Work
- Graph theory
- Complement reducible graphs
- Modular decomposition and transitive orientation
- Fast approximation algorithms for the diameter and radius of sparse graphs
- On the complexity of \(k\)-SAT
- On rigid circuit graphs
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Minimal triangulations of graphs: a survey
- Algorithmic Aspects of Vertex Elimination on Graphs
- Finding and counting small induced subgraphs efficiently
- A Linear Recognition Algorithm for Cographs
- Finding a Minimum Circuit in a Graph
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Title not available (Why is that?)
- Separability generalizes Dirac's theorem
- Graph extremities defined by search algorithms
- Maximum cardinality search for computing minimal triangulations of graphs
- BetweenO(nm) andO(nalpha)
- A vertex incremental approach for maintaining chordality
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Vertex elimination orderings for hereditary graph classes
- Avoidable paths in graphs
- Avoidable vertices and edges in graphs
- Shifting paths to avoidable ones
- Computing and listing avoidable vertices and paths
- The diameter of AT‐free graphs
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)
