Back to Results
First PageMeta Content
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

Document Date: 2014-04-18 22:07:45

Open Document

File Size: 319,04 KB

Share Result on Facebook

Company

L. / Creative Commons / /

IndustryTerm

construction algorithm / linear-time algorithm / computing / linear time algorithm / depth-first search / logspace algorithms / construction algorithms / /

Person

HOMAS T HIERAUF / Thomas Thierauf Fabian Wagner / Let Ci / Bt / B. Lemma / Fabian Wagner / Thomas Thierauf / /

Position

representative / /

ProvinceOrState

New Foundland and Labrador / /

Technology

logspace algorithms / construction algorithms / linear time algorithm / linear-time algorithm / construction algorithm / /

URL

http /

SocialTag