End vertices of graph searches on bipartite graphs

DOI10.1016/j.ipl.2021.106176zbMath1472.68125OpenAlexW3192494677MaRDI QIDQ2234808

Yixin Cao, Zhifeng Wang, Jianxin Wang, Meibiao Zou

Publication date: 19 October 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106176

zbMATH Keywords

graph algorithmsmaximum cardinality searchlexicographic depth-first search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Graph searches and their end vertices

Cites Work

• End-vertices of LBFS of (AT-free) bigraphs
• On end-vertices of lexicographic breadth first searches
• End-vertices of AT-free bigraphs
• A Unified View of Graph Searching
• Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Graph Searches and Their End Vertices.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: End vertices of graph searches on bipartite graphs