Polynomial-time recognition and maximum independent set in Burling graphs
Tytuł:
Polynomial-time recognition and maximum independent set in Burling graphs
Konferencja:
International Workshop on Graph-Theoretic Concepts in Computer Science [WG]
Rok:
2026
Opis:
ruj
Strony:
445-460
Tom (seria wydawnicza):
16124 of Lecture Notes in Computer Science
Numer DOI:
10.1007/978-3-032-11835-6_32
Link:
https://arxiv.org/abs/2407.16666