Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

First Page		Document Content
Date: 2014-04-18 22:07:45 Connected component SPQR tree Biconnected graph Directed acyclic graph Series-parallel graph Reachability Tree decomposition Tree K-vertex-connected graph Graph theory Graph connectivity Biconnected component		Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 319,04 KB Share Document on Facebook

	UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit DocID: 1rkPg - View Document
	On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs ? M. A. Bekos1 , S. Cornelsen2 , L. Grilli3 , S.-H. Hong4 , M. Kaufmann1 1 arXiv:1409.0461v1 [cs.CG] 1 Sep 2014 DocID: 1qv3k - View Document
	Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1 University of Sydney, Australia DocID: 1pWdX - View Document
	A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1 DocID: 1pQMh - View Document
	Two-page Book Embedding and Clustered Graph Planarity Seok-Hee Hong1 Hiroshi Nagamochi2 1 DocID: 1p827 - View Document