On the SPANNING k-TREE problem

Authors:
Leizhen Cai;Frédéric Maffray
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1993

Citing 0
Cited 3

The complexity of the locally connected spanning tree problem

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On the complexity of some subgraph problems

Discrete Applied Mathematics
The complexity of the locally connected spanning tree problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract