Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid.
Steven ChaplickElad CohenJuraj StachoPublished in: WG (2011)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- maximum cardinality
- connected subgraphs
- optimal path
- graph matching
- minimum weight
- graph mining
- bipartite graph
- hamiltonian cycle
- grid services
- average degree
- graph partitioning
- edge weights
- grid points
- vertex set
- random graphs
- computational grids
- neural network
- grid computing
- weighted graph
- constraint satisfaction problems