Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling.
André E. KézdyChi WangPublished in: Discret. Math. (1999)
Keyphrases
- weighted graph
- undirected graph
- reachability queries
- graph representation
- edge weights
- graph matching
- directed graph
- graph theory
- graph structure
- graph model
- adjacency matrix
- graph clustering
- graph theoretic
- labeled graphs
- graph partitioning
- vertex set
- series parallel
- graph classification
- graph databases
- adjacency graph
- random graphs
- graph mining
- subgraph isomorphism
- graph structures
- bipartite graph
- graph theoretical
- spanning tree
- graph properties
- strongly connected
- graph construction
- graph data
- graph kernels
- label propagation
- shortest path
- disjoint paths
- random walk
- inexact graph matching
- graph isomorphism
- finding the shortest path
- graph transformation
- optimal solution
- image segmentation
- active learning
- graph search
- approximation algorithms
- graph representations
- social graphs
- connected dominating set
- evolving graphs
- maximum cardinality
- structural pattern recognition
- structured data
- densely connected
- connected components
- minimum cost
- real world graphs
- graph patterns
- maximum clique
- topological information
- attributed graphs