Construction of Vertex-Disjoint Paths in Alternating Group Networks

Journal of Supercomputing - Netherlands
doi 10.1007/s11227-009-0304-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Vertex Models With Alternating Spins

Asian Journal of Mathematics
MathematicsApplied Mathematics
1998English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001English

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Secure and Efficient Disjoint Multipath Construction for Fault Tolerant Routing in Wireless Sensor Networks

Journal of Network and Computer Applications
HardwareComputer NetworksComputer Science ApplicationsArchitectureCommunications
2011English

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy