Recursive Graphs, Recursive Labelings and Shortest Paths

DOI10.1137/0210028zbMath0471.05055OpenAlexW2017680026MaRDI QIDQ3924251

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

shortest pathdata structureschordal graphsrecursive graphs

Mathematics Subject Classification ID

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

Related Items (13)

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

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