Polynomial-time recognition and maximum independent set in Burling graphs.
Pawel RzazewskiBartosz WalczakPublished in: CoRR (2024)
Keyphrases
- maximum independent set
- independent set
- graph theory
- graph theoretic
- recognition rate
- object recognition
- recognition accuracy
- pattern recognition
- automatic recognition
- graph isomorphism
- activity recognition
- feature extraction
- graph matching
- recognition algorithm
- special case
- action recognition
- computational complexity
- complex networks
- human activities
- worst case
- recognition process
- random graphs
- bounded degree