Skip to main navigation
Skip to search
Skip to main content
Tohoku University Home
English
日本語
Home
Profiles
Research Units
Research output
Search by expertise, name or affiliation
Finding edge-disjoint paths in partial k-trees
X. Zhou
, S. Tamura, T. Nishizeki
INF - System Information Sciences
Research output
:
Contribution to journal
›
Article
›
peer-review
16
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Finding edge-disjoint paths in partial k-trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Trees
80%
Path Problem
60%
Polynomial Time
20%
Linear Time
20%
Combinatorial Problem
20%
Algorithm
20%
Graph
20%
Number
20%
Complete
20%
Earth and Planetary Sciences
Edge
100%
Apex
40%
Integer
20%
Constriction
20%
Algorithms
20%
Position (Location)
20%
Agricultural and Biological Sciences
Trees
100%
Algorithms
20%
Computer Science
Polynomial Time
20%
Tree Graph
20%
Combinatorial Problem
20%
Economics, Econometrics and Finance
Location
20%