Login / Signup
Vertex-colouring edge-weightings with two edge weights.
Mahdad Khatirinejad
Reza Naserasr
Mike Newman
Ben Seamone
Brett Stevens
Published in:
Discret. Math. Theor. Comput. Sci. (2012)
Keyphrases
</>
edge weights
weighted graph
bipartite graph
shortest path
directed graph
spanning tree
minimum weight
undirected graph
minimum spanning tree
satisfy the triangle inequality
directed acyclic graph
triangle inequality
complex networks