Forced color classes, intersection graphs and the strong perfect graph conjecture.
Tadashi SakumaPublished in: Theor. Comput. Sci. (2000)
Keyphrases
- graph representation
- graph theory
- directed graph
- graph theoretic
- graph structure
- graph construction
- weighted graph
- labeled graphs
- graph matching
- graph databases
- graph classification
- graph structures
- adjacency matrix
- graph theoretical
- graph mining
- graph clustering
- color images
- graph partitioning
- graph model
- bounded degree
- directed acyclic
- graph search
- random graphs
- subgraph isomorphism
- graph properties
- dynamic graph
- bipartite graph
- graph drawing
- structural pattern recognition
- series parallel
- graph isomorphism
- graph kernels
- graph data
- undirected graph
- spanning tree
- reachability queries
- graph representations
- maximum common subgraph
- graph transformation
- evolving graphs
- random walk
- color information
- web graph
- structured data
- planar graphs
- graph patterns
- color space
- maximum cardinality
- edge weights
- query graph
- finding the shortest path
- adjacency graph
- dense subgraphs
- minimum spanning tree
- equivalence classes
- maximum clique
- neighborhood graph
- graph embedding
- connected graphs
- connected dominating set
- maximal cliques
- link analysis
- small world
- real world graphs
- connected components
- disk resident
- social graphs
- community discovery
- shortest path
- bounded treewidth