End-Vertices of Graph Search Algorithms

DOI10.1007/978-3-319-18173-8_22zbMath1459.68160OpenAlexW2228103624MaRDI QIDQ2947028

Mathieu Liedloff, Daniel Meister, Dieter Kratsch

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18173-8_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Graph searches and their end vertices ⋮ End-vertices of LBFS of (AT-free) bigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Exact exponential algorithms.
• On end-vertices of lexicographic breadth first searches
• LexBFS-orderings and powers of chordal graphs
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
• LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• A Unified View of Graph Searching
• Algorithmic Aspects of Vertex Elimination on Graphs
• Determinant Sums for Undirected Hamiltonicity

This page was built for publication: End-Vertices of Graph Search Algorithms