Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs.
Ian DeHaanZachary FriggstadPublished in: WADS (2023)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- subgraph isomorphism
- labeled graphs
- graph structures
- graph data
- connected subgraphs
- maximum common subgraph
- reachability queries
- graph properties
- undirected graph
- frequent subgraph mining
- maximum clique
- graph matching
- subgraph mining
- data structure
- query graph
- dense subgraphs
- graph patterns
- graph theory
- maximal cliques
- topological information
- frequent subgraphs
- pattern mining
- graph theoretic
- biological networks
- association graph
- graph representation
- weighted graph