Acyclic matchings in graphs of bounded maximum degree.
Julien BasteMaximilian FürstDieter RautenbachPublished in: Discret. Math. (2022)
Keyphrases
- bounded treewidth
- np hard
- maximum cardinality
- connected graphs
- np complete
- random graphs
- directed graph
- graph databases
- database schemes
- graph theoretic
- complex structures
- graph theory
- bipartite graph
- graph matching
- neural network
- graph model
- graph partitioning
- graph mining
- power law
- graph structure
- graph construction
- lower bound