A note on degree-constrained star subgraphs of bipartite graphs

DOI10.1016/0020-0190(76)90012-0zbMath0346.68023OpenAlexW2021561144MaRDI QIDQ1233725

Harold N. Gabow

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90012-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items (1)

The clever shopper problem

Cites Work

• Parallel concepts in graph theory
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on degree-constrained star subgraphs of bipartite graphs