scientific article

DOI10.4086/cjtcs.2014.002zbMath1391.68061OpenAlexW4253869060MaRDI QIDQ3191145

Fabian Wagner, Thomas Thierauf

Publication date: 24 September 2014

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2014.002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilityplanar graphslogspace\(K_5\)-free graphs\(K_{3,3}\)-free graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Counting the number of perfect matchings in \(K_{5}\)-free graphs ⋮ Derandomizing Isolation in Space-Bounded Settings

Cites Work

• On-line maintenance of triconnected components with SPQR-trees
• Problems complete for deterministic logarithmic space
• Dividing a Graph into Triconnected Components
• Making Nondeterminism Unambiguous

This page was built for publication: