Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.
Maximum weight independent sets and cliques in intersection graphs of filaments.Information Processing Letters, 73(5–6):181–188
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial-time recognition and maximum independent set in Burling graphs
Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.