scientific article; zbMATH DE number 2086689

zbMath1057.68654MaRDI QIDQ4737226

Ryuhei Uehara

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800993.htm

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

zbMATH Keywords

strongly chordal graphsdesign and analysis of algorithmslexicographic breadth first searchChordal bipartite graphsvertex elimination ordering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Satisfiability of acyclic and almost acyclic CNF formulas ⋮ Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs ⋮ \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs ⋮ Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs ⋮ Graph classes and the switch Markov chain for matchings ⋮ From a simple elimination ordering to a strong elimination ordering in linear time ⋮ The cyclic rank completion problem with general blocks

This page was built for publication: