Login / Signup
The number of removable edges in a 4-connected graph.
Jichang Wu
Xueliang Li
Jianji Su
Published in:
J. Comb. Theory, Ser. B (2004)
Keyphrases
</>
directed graph
undirected graph
computational complexity
connected components
directed acyclic graph
spanning tree
database
neural network
image processing
bayesian networks
np hard
weighted graph
edge weights
polynomial time complexity
connected graphs