Sign in
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.
Kazuyuki Miura
Daishiro Takahashi
Shin-Ichi Nakano
Takao Nishizeki
Published in:
Int. J. Found. Comput. Sci. (1999)
Keyphrases
</>
spanning tree
planar graphs
minimum weight
undirected graph
edge disjoint
minimum spanning tree
minimum cost
weighted graph
approximate inference
np hard
edge weights
total length