Old Web
English
Sign In
Acemap
>
Paper
>
Graph Inference from a Walk for Trees of Bounded Degree 3 is NP-Complete
Graph Inference from a Walk for Trees of Bounded Degree 3 is NP-Complete
1994
Osamu Maruyama
osamu maruyama
Satoru Miyano
satosi miyano
Keywords:
Null graph
Butterfly graph
Quartic graph
Combinatorics
Graph power
Graph bandwidth
Voltage graph
Discrete mathematics
Strength of a graph
Mathematics
Simplex graph
Line graph
Degree (graph theory)
Cubic graph
Regular graph
Tree (graph theory)
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
7
Citations
NaN
KQI
[]