An efficient algorithm for finding a two-pair, and its applications
From MaRDI portal
Publication:1814097
DOI10.1016/0166-218X(91)90033-SzbMath0748.05085OpenAlexW2024353971MaRDI QIDQ1814097
Srinivasa R. Arikati, C. Pandu Rangan
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(91)90033-s
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Minimal triangulations of graphs: a survey ⋮ A vertex incremental approach for maintaining chordality ⋮ Algorithms for interval catch digraphs ⋮ Unnamed Item ⋮ Algorithms for weakly triangulated graphs ⋮ Path parity and perfection ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ A new characterization of HH-free graphs ⋮ Linear layouts of weakly triangulated graphs ⋮ A separator-based method for generating weakly chordal graphs
Cites Work
This page was built for publication: An efficient algorithm for finding a two-pair, and its applications
