Distributed minimum vertex coloring and maximum independent set in chordal graphs.
Christian KonradViktor ZamaraevPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- maximum independent set
- graph theory
- undirected graph
- graph theoretic
- independent set
- spanning tree
- directed graph
- minimum cost
- distributed systems
- cooperative
- distributed environment
- hamiltonian cycle
- labeled graphs
- peer to peer
- bipartite graph
- minimum length
- mobile agents
- graph structure
- maximum cardinality
- attributed graphs
- minimum weight
- subgraph isomorphism
- graph representation
- social networks
- approximation algorithms
- graph matching
- connected components
- shortest path
- multi agent