An efficient algorithm for finding a two-pair, and its applications

DOI10.1016/0166-218X(91)90033-SMaRDI QIDQ1814097zbMATH OpenOpenAlexFDO

Authors S. 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

zbMATH Keywords

algorithmcomputational geometrychordless pathweakly triangulated graphs

Mathematics Subject Classification ID

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

Recommendations

• An efficient algorithm for the bipartite matching problem
• An algorithm for finding homogeneous pairs
• scientific article; zbMATH DE number 2081005
• scientific article; zbMATH DE number 4014451
• Parameterized and approximation algorithms for finding two disjoint matchings
• Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
• scientific article; zbMATH DE number 1305400
• Efficient algorithms for Petersen's matching theorem
• Faster algorithm for finding maximum 1-restricted simple 2-matchings
• On Nagata's pairwise algorithm

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• Covering orthogonal polygons with star polygons: The perfect graph approach
• Perfect Graphs and Orthogonally Convex Covers

Cited in

(12)

• Gender-aware facility location in multi-gender world
• Organizing the atoms of the clique separator decomposition into an atom tree
• Path parity and perfection
• Algorithms for interval catch digraphs
• A vertex incremental approach for maintaining chordality
• Minimal triangulations of graphs: a survey
• A separator-based method for generating weakly chordal graphs
• Linear layouts of weakly triangulated graphs
• scientific article; zbMATH DE number 4117882 (Why is no real title available?)
• Algorithms for weakly triangulated graphs
• A new characterization of HH-free graphs
• Symmetric graph-theoretic roles of two-pairs and chords of cycles

This page was built for publication: An efficient algorithm for finding a two-pair, and its applications

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