Deadlock resolution in wait-for graphs by vertex/arc deletion.
Alan Diêgo Aurélio CarneiroFábio ProttiUéverton S. SouzaPublished in: J. Comb. Optim. (2019)
Keyphrases
- directed graph
- labeled graphs
- undirected graph
- attributed graphs
- maximum cardinality
- hamiltonian cycle
- edge weights
- minimum length
- weighted graph
- graph structure
- high resolution
- graph theory
- graph mining
- graph databases
- connected subgraphs
- graph matching
- graph clustering
- graph theoretic
- consequence finding
- average degree
- bipartite graph
- low resolution
- vertex set
- graph representation
- series parallel
- sampling rate
- small world
- data sets
- spanning tree
- super resolution
- graphical models
- pattern recognition