scientific article; zbMATH DE number 468643
From MaRDI portal
Publication:4272121
zbMath0804.05067MaRDI QIDQ4272121
K. F. Prisakar', Feodor F. Dragan, Victor Chepoi
Publication date: 29 August 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
Complexity issues of perfect secure domination in graphs ⋮ Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ \(r\)-dominating cliques in graphs with hypertree structure ⋮ Injective hulls of various graph classes ⋮ On neighborhood-Helly graphs ⋮ Perfect elimination orderings for symmetric matrices ⋮ Incidence graphs of biacyclic hypergraphs ⋮ Homogeneously orderable graphs ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Dually chordal graphs ⋮ LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings
This page was built for publication:
