Recursive Graphs, Recursive Labelings and Shortest Paths

DOI10.1137/0210028MaRDI QIDQ3924251zbMATH OpenOpenAlexFDO

Authors Andrzej Proskurowski

Publication date 1981

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0210028

zbMATH Keywords

chordal graphsdata structuresrecursive graphsshortest path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(13)

• Knowledge representation for mathematical discovery: Three experiments in graph theory
• Canonical representations of partial 2- and 3-trees
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• Unified all-pairs shortest path algorithms in the chordal hierarchy
• Subclasses of \(k\)-trees: characterization and recognition
• Equilateral drawing of 2-connected planar chordal graphs
• A Cryptographic Code Based on Digraphs
• Canonical representations of partial 2-and 3-trees
• Hierarchical and modularly-minimal vertex colorings
• Leader-follower coherence in noisy ring-trees networks
• Efficient sets in partial k-trees
• Separating subgraphs in k-trees: Cables and caterpillars
• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees

This page was built for publication: Recursive Graphs, Recursive Labelings and Shortest Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3924251)