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