Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules.
Armen S. AsratianCarl Johan CasselgrenPetros A. PetrosyanPublished in: Discret. Appl. Math. (2023)
Keyphrases
- multistage
- graph mining
- graph databases
- labeled graphs
- subgraph matching
- graph properties
- subgraph isomorphism
- reachability queries
- graph structures
- maximum common subgraph
- production system
- connected subgraphs
- frequent subgraph mining
- graph data
- single stage
- stochastic optimization
- stochastic programming
- dynamic programming
- subgraph mining
- scheduling problem
- dense subgraphs
- query graph
- maximum clique
- graph patterns
- graph matching
- lot sizing
- graph theory
- optimal policy
- topological information
- pattern mining
- maximal cliques
- graph theoretic
- directed graph
- production line
- graph kernels
- quasi cliques
- assembly systems
- attack detection
- graph structure
- lot streaming
- data structure