Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
36
click to vote
ISCI
2008
favorite
Email
discuss
report
107
views
more
ISCI 2008
»
Constructing vertex-disjoint paths in (n, k)-star graphs
13 years 10 months ago
Download
par.cse.nsysu.edu.tw
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph with
Tsung-Chi Lin, Dyi-Rong Duh
Real-time Traffic
Algorithm
|
General
|
ISCI 2006
|
ISCI 2008
|
Routing
|
claim paper
Related Content
»
Construction of asymmetric connectors of depth two
»
Shortest VertexDisjoint TwoFace Paths in Planar Graphs
»
Testing 2Vertex Connectivity and Computing Pairs of VertexDisjoint st Paths in Digraphs
»
Vertex disjoint routings of cycles over tori
»
Parameterized Approximability of the Disjoint Cycle Problem
»
Unconditionally reliable message transmission in directed networks
»
Labeling Schemes for Vertex Connectivity
»
Finding Disjoint Paths in Expanders Deterministically and Online
»
Counting Subgraphs via Homomorphisms
more »
Post Info
More Details (n/a)
Added
27 Dec 2010
Updated
27 Dec 2010
Type
Journal
Year
2008
Where
ISCI
Authors
Tsung-Chi Lin, Dyi-Rong Duh
Comments
(0)
Researcher Info
ISCI 2008 Study Group
Computer Vision