The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs.
Benoît DartiesRodolphe GiroudeauJean-Claude KönigValentin PolletPublished in: COCOA (2019)
Keyphrases
- bounded degree
- bounded treewidth
- graph theoretic
- np complete
- graph mining
- decision problems
- graph properties
- subgraph matching
- connected components
- graph theory
- graph databases
- labeled graphs
- graph classification
- graph data
- np hard
- subgraph isomorphism
- databases
- maximum weight
- bipartite graph
- kernel methods
- integrity constraints
- frequent subgraph mining
- objective function