Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs.
Niels GrüttemeierChristian KomusiewiczNils MorawietzPublished in: SWAT (2020)
Keyphrases
- low degree
- edge weights
- weighted graph
- graph mining
- graph databases
- subgraph matching
- graph data
- subgraph isomorphism
- threshold functions
- graph classification
- labeled graphs
- undirected graph
- uniform distribution
- graph properties
- maximum clique
- bipartite graph
- query graph
- frequent subgraphs
- agnostic learning
- decision lists
- edge detection
- spanning tree
- shortest path
- graph matching