Algorithms for a maximum clique and a maximum independent set of a circle graph.Networks, 3(3):261–273

Fănică Gavril · 1973

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2024-07-23 · unverdicted · novelty 8.0

Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.

Showing 1 of 1 citing paper.

Polynomial-time recognition and maximum independent set in Burling graphs math.CO · 2024-07-23 · unverdicted · none · ref 6
Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.