Periodic scheduling of marked graphs using balanced binary words.
Jean-Vivien MilloRobert de SimonePublished in: Theor. Comput. Sci. (2012)
Keyphrases
- scheduling problem
- series parallel
- graph matching
- scheduling algorithm
- n gram
- round robin
- graph theoretic
- keywords
- graph theory
- graph mining
- graph databases
- word recognition
- graph representation
- spanning tree
- resource constraints
- word sense disambiguation
- text documents
- word segmentation
- multi class
- binary data
- response time
- resource allocation
- english words
- unknown words
- flexible manufacturing systems
- related words
- graph structures
- weighted graph
- information systems
- graph model