C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Approximability of the Path-Distance-Width for AT-free Graphs.
Yota Otachi
Toshiki Saitoh
Katsuhisa Yamanaka
Shuji Kijima
Yoshio Okamoto
Hirotaka Ono
Yushi Uno
Koichi Yamazaki
Published in:
WG (2011)
Keyphrases
</>
distance measure
shortest path
distance function
euclidean distance
path length
complex structures
graph theory
strongly connected
edge weights
graph model
graph matching
weighted graph
endpoints
search algorithm
bipartite graph
graph representation
distance metric
pattern recognition