Isomorphic tree spanner problems

DOI10.1007/BF01293665zbMath0833.68091MaRDI QIDQ1899446

Leizhen Cai, Derek Gordon Corneil

Publication date: 9 October 1995

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsNP-completetree \(t\)-spanner

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Edge-disjoint spanners of complete graphs and complete digraphs

Uses Software

• CMPT

Cites Work

• Unnamed Item
• The complexity of restricted spanning tree problems
• An Analysis of a Good Algorithm for the Subtree Problem
• Subtree Isomorphism in O(n5/2)
• An Optimal Synchronizer for the Hypercube
• Tree Spanners
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs