Computing and listing avoidable vertices and paths

DOI10.1007/s00453-023-01168-2OpenAlexW4386420802MaRDI QIDQ6185944

Athanasios E. Zisis, Charis Papadopoulos

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

zbMATH Keywords

minimal triangulationssimplicial verticesavoidable edgesavoidable vertices

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• On rigid circuit graphs
• Minimal triangulations of graphs: a survey
• A vertex incremental approach for maintaining chordality
• Complement reducible graphs
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Modular decomposition and transitive orientation
• Separability generalizes Dirac's theorem
• Graph extremities defined by search algorithms
• Maximum cardinality search for computing minimal triangulations of graphs
• Avoidable paths in graphs
• Avoidable vertices and edges in graphs
• Vertex elimination orderings for hereditary graph classes
• A new algorithm for optimal 2-constraint satisfaction and its implications
• BetweenO(nm) andO(n^alpha)
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• A Linear Recognition Algorithm for Cographs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Finding a Minimum Circuit in a Graph
• Fast approximation algorithms for the diameter and radius of sparse graphs
• On the complexity of \(k\)-SAT
• Shifting paths to avoidable ones
• The diameter of AT‐free graphs
• Computing and listing avoidable vertices and paths

This page was built for publication: Computing and listing avoidable vertices and paths