Sciweavers

FCT
2009
Springer

146views Applied Computing» more FCT 2009»

Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space

14 years 3 months ago

We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...

Thomas Thierauf, Fabian Wagner

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers