Entropy and a certain cost-minimal coloring of graph vertices.
Yasuichi HoribeRyoji MitaniPublished in: Appl. Math. Lett. (2007)
Keyphrases
- weighted graph
- labeled graphs
- undirected graph
- hamiltonian cycle
- directed edges
- directed graph
- adjacency matrix
- random walk
- mutual information
- vertex set
- maximal cliques
- graph structure
- cost sensitive
- random graphs
- edge weights
- high cost
- graph theory
- information theoretic
- planar graphs
- graph representation
- minimum weight
- graph model
- query graph
- path length
- connected graphs
- minimum cost
- average degree
- expected cost
- bipartite graph
- maximum cardinality
- maximum matching
- total cost
- graph matching
- graph structures
- shortest path
- directed acyclic graph
- attributed graphs
- information theory