Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review.
Matthias BentertRené van BevernRolf NiedermeierPublished in: J. Sched. (2019)
Keyphrases
- graph mining
- graph databases
- labeled graphs
- subgraph isomorphism
- connected subgraphs
- graph structures
- subgraph matching
- graph properties
- graph data
- scheduling problem
- data structure
- maximum common subgraph
- dense subgraphs
- reachability queries
- maximum clique
- scheduling algorithm
- series parallel
- graph theory
- topological information
- machine learning
- resource allocation
- frequent subgraph mining
- graph matching
- inductive learning
- graph patterns
- frequent subgraphs
- biological networks
- graph representation
- parallel machines
- pattern mining
- subgraph mining
- resource constraints
- information systems
- graph structure
- flexible manufacturing systems
- maximal cliques
- bipartite graph
- query graph
- inductive logic programming
- knowledge representation