DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine.
Hyeonji KimJuneyoung LeeSourav S. BhowmickWook-Shin HanJeong-Hoon LeeSeongyun KoMoath H. A. JarrahPublished in: SIGMOD Conference (2016)
Keyphrases
- single machine
- identical machines
- scheduling problem
- graph databases
- graph mining
- graph data
- processing times
- total weighted tardiness
- earliness tardiness
- dynamic programming
- minimize total
- release dates
- search space
- maximum lateness
- total tardiness
- release times
- production scheduling
- scheduling jobs
- weighted tardiness
- rolling horizon
- parallel machines
- competitive ratio
- weighted number of tardy jobs
- setup times
- learning effect
- graph theory
- sequence dependent setup times
- number of late jobs
- np hard
- graph structure
- weighted graph
- graph model
- bipartite graph
- edge weights
- shared memory
- upper bound
- special case
- precedence constraints
- lower bound