Vertex Coloring of a Graph for Memory Constrained Scenarios.
Eduardo Sant'Ana da SilvaHélio PedriniPublished in: Math. Comput. Sci. (2020)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- minimum weight
- edge weights
- vertex set
- random walk
- graph structure
- hamiltonian cycle
- maximum cardinality
- attributed graphs
- memory size
- memory requirements
- spanning tree
- graph representation
- graph theoretic
- memory usage
- graph model
- average degree
- directed acyclic graph
- graph search
- structured data
- connected subgraphs
- graph theory
- bipartite graph
- betweenness centrality
- stable set
- minimum spanning tree
- dependency graph
- graph structures
- random graphs
- graph clustering
- memory space
- real world
- graph data
- genetic algorithm