Login / Signup
Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs.
Cristina López-Ramírez
Jorge Eduardo Gutiérrez-Gómez
Guillermo De Ita Luna
Published in:
LANMR (Selected Papers) (2019)
Keyphrases
</>
independent set
planar graphs
minimum weight
maximum weight
undirected graph
bipartite graph
spanning tree
weighted graph
minimum spanning tree
greedy heuristic
directed graph
worst case
complex networks
randomized algorithm