Clique-free t-matchings in degree-bounded graphs.
Katarzyna E. PaluchMateusz WasylkiewiczPublished in: CoRR (2024)
Keyphrases
- independent set
- maximum clique
- maximum cardinality
- graph properties
- graph theoretic
- random graphs
- quasi cliques
- directed graph
- graph model
- bounded treewidth
- graph representation
- maximum independent set
- series parallel
- graph databases
- pairwise
- pattern recognition
- fully connected
- graph partitioning
- maximum weight
- weighted graph
- graph theory
- graph matching
- data sets