Computing and listing avoidable vertices and paths

DOI10.1007/978-3-031-20624-5_7arXiv2108.07160OpenAlexW3194226266MaRDI QIDQ6108998

Athanasios E. Zisis, Charis Papadopoulos

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.07160

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Computing and listing avoidable vertices and paths ⋮ Computing and listing avoidable vertices and paths

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
• 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
• 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