Algorithms for weakly triangulated graphs
- 12 May 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 59 (2) , 181-191
- https://doi.org/10.1016/0166-218x(93)e0161-q
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Finding large holesInformation Processing Letters, 1991
- An efficient algorithm for finding a two-pair, and its applicationsDiscrete Applied Mathematics, 1991
- Optimizing weakly triangulated graphsGraphs and Combinatorics, 1990
- Covering orthogonal polygons with star polygons: The perfect graph approachJournal of Computer and System Sciences, 1990
- Optimizing weakly triangulated graphsGraphs and Combinatorics, 1989
- Perfect Graphs and Orthogonally Convex CoversSIAM Journal on Discrete Mathematics, 1989
- Weakly triangulated graphsJournal of Combinatorial Theory, Series B, 1985