scientific article

From MaRDI portal

Revision as of 19:34, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3886876

Jump to:navigation, search

zbMath0443.68047MaRDI QIDQ3886876

Maciej M. Sysło, Masao Iri

Publication date: 1979

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

zbMATH Keywords

outerplanar graphs depth-first search efficient algorithm outerplanar embedding in the plane palm tree sampling tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Fast recognition of classes of almost-median graphs ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ A Pfaffian formula for matching polynomials of outerplanar graphs ⋮ Heuristics for the maximum outerplanar subgraph problem ⋮ An approach to the subgraph homeomorphism problem ⋮ A linear-time certifying algorithm for recognizing generalized series-parallel graphs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3886876&oldid=17529291"