Maximum weight independent sets and cliques in intersection graphs of filaments
Author:
- Fanica GavrilFGFanica Gavril
- 1 March 2000
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 73 (5-6) , 181-188
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Trapezoid graphs and generalizations, geometry and algorithmsDiscrete Applied Mathematics, 1997
- Intersection graphs of Helly families of subtreesDiscrete Applied Mathematics, 1996
- $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc GraphsSIAM Journal on Computing, 1995
- Recognition of Circle GraphsJournal of Algorithms, 1994
- Thresholds for classes of intersection graphsDiscrete Mathematics, 1992
- Decomposition by clique separatorsDiscrete Mathematics, 1985
- Comparability graphs and intersection graphsDiscrete Mathematics, 1983
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Algorithms on circular‐arc graphsNetworks, 1974
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973