(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs.
Matthias BentertRené van BevernRolf NiedermeierPublished in: CoRR (2017)
Keyphrases
- graph mining
- graph properties
- graph databases
- labeled graphs
- graph data
- scheduling problem
- graph structures
- graph theoretic
- equivalence classes
- subgraph mining
- subgraph isomorphism
- topological information
- frequent subgraph mining
- wireless communication
- graph theory
- weighted graph
- random walk
- subgraph matching
- maximum clique
- directed acyclic graph
- scheduling algorithm
- directed graph
- wireless networks
- bounded degree
- graph patterns
- connected components
- class labels
- structured data
- wireless broadcast
- reachability queries
- connected subgraphs
- quasi cliques
- communication technologies
- maximal cliques
- graph representation
- data structure
- mobile networks
- graph model
- bipartite graph
- graph matching
- mobile devices