Quasi-bipartite graph

#	Item
1	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximating Full Steiner Tree in a Unit Disk Graph Ahmad Biniaz∗ Anil Maheshwari∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-18 15:41:52 NP-complete problems Steiner tree problem Spanning tree Tree Graph Graph coloring Matroid theory Quasi-bipartite graph Minimum spanning tree Graph theory Theoretical computer science Mathematics
2	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Note on Online Steiner Tree Problems Gokarna Sharma∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 14:13:50 Network theory Shortest path problem Binary tree Tree Steiner tree problem Connectivity Minimum spanning tree Quasi-bipartite graph Graph theory Theoretical computer science Mathematics
3	Improved Steiner Tree Approximation in Graphs Gabriel Robinsy and Alexander Zelikovskyz y Add to Reading List Source URL: www.cs.virginia.edu Language: English - Date: 1999-10-25 15:38:00 Spanning tree NP-complete problems Steiner tree problem NP-hard problems Quasi-bipartite graph Minimum spanning tree Rectilinear Steiner tree Vertex cover Matching Graph theory Theoretical computer science Mathematics