scientific article; zbMATH DE number 1754610

From MaRDI portal

Revision as of 09:58, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:4535037

Jump to:navigation, search

zbMath0986.68951MaRDI QIDQ4535037

Zhangjian Li, Shin-ichi Nakano

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760433

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Family Trees for Enumeration ⋮ Escape from the room ⋮ On approximating the \(d\)-girth of a graph ⋮ Listing All Plane Graphs ⋮ Fast minor testing in planar graphs ⋮ Efficient enumeration of all ladder lotteries and its application ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Generating All Triangulations of Plane Graphs (Extended Abstract) ⋮ Random Generation and Enumeration of Proper Interval Graphs ⋮ On Approximating the d-Girth of a Graph

This page was built for publication:

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