Old Web
English
Sign In
Acemap
>
Paper
>
Computing Experiment-based Evaluation of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph
Computing Experiment-based Evaluation of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph
2009
Suga Yuji
Yoshida Hiroyuki
Takafuji Daisuke
Watanabe Toshimasa
Keywords:
Tree decomposition
Graph bandwidth
Gomory–Hu tree
Machine learning
Heuristic
Theoretical computer science
Graph
SPQR tree
Artificial intelligence
Computer science
Algorithm
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]