Search results for "edge-disjoint"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Chandra Chekuri, Sanjeev Khanna	Edge-disjoint paths revisited.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
3	Mingji Xia	Maximum Edge-Disjoint Paths Problem in Planar Graphs.	TAMC	2007	DBLP DOI BibTeX RDF	maximum edge-disjoint paths, #P-hard, determinant
3	Matthew Andrews, Lisa Zhang	Logarithmic hardness of the undirected edge-disjoint paths problem.	J. ACM	2006	DBLP DOI BibTeX RDF	Hardness of approximation, undirected graphs, edge-disjoint paths
3	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Edge-disjoint paths in Planar graphs with constant congestion.	STOC	2006	DBLP DOI BibTeX RDF	Planar graphs, multicommodity flow, edge-disjoint paths
3	Matthew Andrews, Lisa Zhang	Hardness of the undirected edge-disjoint paths problem.	STOC	2005	DBLP DOI BibTeX RDF	hardness of approximation, undirected graphs, edge-disjoint paths
3	Jan M. Hochstein, Karsten Weihe	Edge-disjoint routing in plane switch graphs in linear time.	J. ACM	2004	DBLP DOI BibTeX RDF	Planar graphs, edge-disjoint paths
3	Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung	Constructing Edge-Disjoint Spanning Trees in Product Networks.	IEEE Trans. Parallel Distrib. Syst.	2003	DBLP DOI BibTeX RDF	Cartesian product networks, edge-disjoint trees, fault-tolerance, interconnection networks, embedding, spanning trees
3	Xiao Zhou, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees.	Algorithmica	2000	DBLP DOI BibTeX RDF	Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth
3	Aravind Srinivasan	Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems.	FOCS	1997	DBLP DOI BibTeX RDF	multi-commodity flow relaxation, multiprocessor interconnection networks, edge-disjoint paths, unsplittable flow, routing problems
3	Qian-Ping Gu, Hisao Tamaki	Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	algorithm, Permutation routing, edge-disjoint paths, circuit-switched networks
3	Xiao Zhou, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).	ISAAC	1996	DBLP DOI BibTeX RDF	bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree
2	Naoki Katoh, Shin-ichi Tanigawa	A proof of the molecular conjecture.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	bar-and-joint frameworks, body-and-hinge frameworks, edge-disjoint spanning trees, the molecular conjecture, rigidity
2	Ruen Chze Loh, Sieteng Soh, Mihai Lazarescu, Suresh Rai	A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network.	PRDC	2008	DBLP DOI BibTeX RDF
2	Markus Maier, Steffen Mecke, Dorothea Wagner	Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks.	SOFSEM	2007	DBLP DOI BibTeX RDF
2	Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster	Approximation algorithms and hardness results for cycle packing problems.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap
2	Dirk Müller	On the complexity of the planar directed edge-disjoint paths problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C38, 68Q17, 68R10, 90C35
2	Satish Rao, Shuheng Zhou	Edge Disjoint Paths in Moderately Connected Graphs.	ICALP	2006	DBLP DOI BibTeX RDF
2	Adrian Kosowski	Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.	SIROCCO	2006	DBLP DOI BibTeX RDF
2	Jeongsoo Han	Network-Adaptive QoS Routing Using Local Information.	APNOMS	2006	DBLP DOI BibTeX RDF	Localized Adaptive QoS Routing, Exploration Bonus, Certainty Equivalency Approximation, Edge-disjoint multi-path, Reinforcement Learning, POMDP
2	Li Yang	Building k Edge-Disjoint Spanning Trees of Minimum Total Length for Isometric Data Embedding.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF	dimensionality reduction, minimum spanning tree, manifold learning, Data embedding, neighborhood graph
2	Chuan-Ching Sue, Min-Shao Shieh, Chin-Yu Huang	Dependable WDM networks with reconfigurable edge-disjoint p-cycles.	ITRE	2005	DBLP DOI BibTeX RDF
2	Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang	Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.	FOCS	2005	DBLP DOI BibTeX RDF
2	Chien-Hung Huang, Jywe-Fei Fang, Chin-Yang Yang	Edge-Disjoint Hamiltonian Cycles of WK-Recursive Networks.	PARA	2004	DBLP DOI BibTeX RDF
2	Hyunseung Choo, Vladimir V. Shakhov	Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
2	Maria J. Blesa, Christian Blum	Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem.	EvoWorkshops	2004	DBLP DOI BibTeX RDF
2	Chuan-Ching Sue, Yung-Chiao Chen, Min-Shao Shieh, Sy-Yen Kuo	Dependable WDM Networks with Edge-Disjoint P-Cycles.	ISPA	2004	DBLP DOI BibTeX RDF
2	Luke Mathieson, Elena Prieto, Peter Shaw	Packing Edge Disjoint Triangles: A Parameterized View.	IWPEC	2004	DBLP DOI BibTeX RDF
2	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Edge-Disjoint Paths in Planar Graphs.	FOCS	2004	DBLP DOI BibTeX RDF
2	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	The all-or-nothing multicommodity flow problem.	STOC	2004	DBLP DOI BibTeX RDF	all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths
2	Pallavi Manohar, V. Sridhar	Routing, Wavelength Assignment in Optical Networks Using an Efficient and Fair EDP Algorithm.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF	Edge Disjoint Path Algorithms, Optical Networks, Routing and Wavelength Assignment
2	Myung M. Bae, Bella Bose	Edge Disjoint Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Lee distance Gray codes, binary Gray codes, hypercube, Hamiltonian cycle, k-ary n-cubes, Lee distance
2	Myung Hee Kim, Hyunseung Choo, Byung Ho Yae, Jonghyun Lee	A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths.	Human.Society@Internet 2003	2003	DBLP DOI BibTeX RDF
2	Paz Carmi, Thomas Erlebach, Yoshio Okamoto	Greedy Edge-Disjoint Paths in Complete Graphs.	WG	2003	DBLP DOI BibTeX RDF	Shortening lemma, Approximation algorithm, Greedy algorithm
2	Aleksandrs Slivkins	Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs.	ESA	2003	DBLP DOI BibTeX RDF
2	Chandra Chekuri, Sanjeev Khanna	Edge disjoint paths revisited.	SODA	2003	DBLP DOI BibTeX RDF
2	R. Sai Anand, Thomas Erlebach	On-line Algorithms for Edge-Disjoint Paths in Trees of Rings.	LATIN	2002	DBLP DOI BibTeX RDF
2	Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman	Algorithms for fault-tolerant routing in circuit switched networks.	SPAA	2002	DBLP DOI BibTeX RDF	flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths
2	Myung M. Bae, Bella Bose	Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles. (PDF / PS)	IPDPS	2000	DBLP DOI BibTeX RDF
2	Thomas Erlebach, Klaus Jansen	Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Qian-Ping Gu, Shietung Peng	Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. (PDF / PS)	ICPP	2000	DBLP DOI BibTeX RDF	WDM all-optical networks, routing algorithms, multistage interconnection networks, Permutation routing, edge-disjoint paths, BPC permutations
2	Karsten Weihe	Edge-Disjoint Routing in Plane Switch Graphs in Linear Time.	FOCS	1999	DBLP DOI BibTeX RDF	Graph algorithms, planar graphs, disjoint paths
2	Xiao Zhou, Takao Nishizeki	The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.	ISAAC	1998	DBLP DOI BibTeX RDF
2	Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks	On the totalk-diameter of connection networks. (PDF / PS)	ISTCS	1997	DBLP DOI BibTeX RDF	k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network
2	Paraskevi Fragopoulou, Selim G. Akl	Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF	edge-disjoint trees, fault tolerance, parallel algorithm, interconnection network, spanning tree, star network, Communication algorithm
2	Paraskevi Fragopoulou, Selim G. Akl	Fault tolerant communication algorithms on the star network using disjoint paths.	HICSS	1995	DBLP DOI BibTeX RDF	fault-tolerant communication algorithms, node pairs, directed edge-disjoint spanning trees, single-node broadcasting, multinode broadcasting, single-node scattering problem, all-port communication assumption, faulty edges, multinode scattering problem, interconnection networks, fault tolerant computing, broadcasting, graph, multiprocessor interconnection networks, trees (mathematics), disjoint paths, star network, message transmission, faulty nodes
2	Karsten Weihe	Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time.	ESA	1994	DBLP DOI BibTeX RDF
2	Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener	Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).	SWAT	1994	DBLP DOI BibTeX RDF	parallel computations, communication algorithms
2	C. P. Gopalakrishnan, C. Pandu Rangan	Edge-Disjoint Paths in Permutation Graphs.	ISAAC	1994	DBLP DOI BibTeX RDF
2	Dorothea Wagner, Karsten Weihe	A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.	ESA	1993	DBLP DOI BibTeX RDF
2	H. Narayanan, Huzur Saran, Vijay V. Vazirani	Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees.	SODA	1992	DBLP DOI BibTeX RDF
2	Arch D. Robison	A group of permutations with edge-disjoint paths on hypercubes.	SPDP	1991	DBLP DOI BibTeX RDF
2	Andreas Schwill	Shorest Edge-Disjoint Paths in Graphs.	STACS	1989	DBLP DOI BibTeX RDF
2	Hrushikesha Mohanty, G. P. Bhattacharjee	A Distributed Algorithm for Edge-Disjoint Path Problem.	FSTTCS	1986	DBLP DOI BibTeX RDF
1	Tomás Feder, Carlos S. Subi	Packing Edge-Disjoint Triangles in Given Graphs.	Electronic Colloquium on Computational Complexity (ECCC)	2012	DBLP BibTeX RDF
1	Stephan Wagner, Marcel Wild	Decomposing the hypercube Qn into n isomorphic edge-disjoint trees.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Hannah Alpert, Jennifer Iglesias	Length 3 Edge-Disjoint Paths and Partial Orientation	CoRR	2012	DBLP BibTeX RDF
1	Serge Gaspers	From edge-disjoint paths to independent paths	CoRR	2012	DBLP BibTeX RDF
1	Ken-ichi Kawarabayashi, Yusuke Kobayashi	Edge-disjoint Odd Cycles in 4-edge-connected Graphs.	STACS	2012	DBLP DOI BibTeX RDF
1	Jácint Szabó	Upgrading edge-disjoint paths in a ring.	Discrete Optimization	2011	DBLP DOI BibTeX RDF
1	Ruo-Wei Hung	Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Ruen Chze Loh, Sieteng Soh, Mihai Lazarescu	Addressing the Most Reliable Edge-Disjoint Paths With a Delay Constraint.	IEEE Transactions on Reliability	2011	DBLP DOI BibTeX RDF
1	Jung-Hwan Chang	An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs.	JIPS	2011	DBLP DOI BibTeX RDF
1	Longkun Guo, Hong Shen	Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs.	FAW-AAIM	2011	DBLP DOI BibTeX RDF
1	Loïc Seguin-Charbonneau, F. Bruce Shepherd	Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2.	FOCS	2011	DBLP DOI BibTeX RDF
1	Fawaz M. Al-Azemi, Mehmet Hakan Karaata	Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs.	SSS	2011	DBLP DOI BibTeX RDF
1	Ken-ichi Kawarabayashi, Yusuke Kobayashi	Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two.	STOC	2011	DBLP DOI BibTeX RDF
1	Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert	The k edge-disjoint 3-hop-constrained paths polytope.	Discrete Optimization	2010	DBLP DOI BibTeX RDF
1	Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang	Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen	Packing edge-disjoint cycles in graphs and the cyclomatic number.	Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Ming-Chien Yang	Constructing edge-disjoint spanning trees in twisted cubes.	Inf. Sci.	2010	DBLP DOI BibTeX RDF
1	Sylwia Cichacz, Agnieszka Görlich	Edge-disjoint Open Trails in Complete Bipartite Multigraphs.	Graphs and Combinatorics	2010	DBLP DOI BibTeX RDF
1	Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang	Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.	Combinatorica	2010	DBLP DOI BibTeX RDF
1	Ruo-Wei Hung	Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes	CoRR	2010	DBLP BibTeX RDF
1	Ruo-Wei Hung	Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes	CoRR	2010	DBLP BibTeX RDF
1	Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn	A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks	CoRR	2010	DBLP BibTeX RDF
1	Aleksandrs Slivkins	Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Satish Rao, Shuheng Zhou	Edge Disjoint Paths in Moderately Connected Graphs.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Ken-ichi Kawarabayashi, Yusuke Kobayashi	The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs.	SODA	2010	DBLP BibTeX RDF
1	Matthew Andrews	Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions.	FOCS	2010	DBLP DOI BibTeX RDF
1	Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn	A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks.	SOFSEM	2010	DBLP DOI BibTeX RDF
1	Ruen Chze Loh, Sieteng Soh, Mihai Lazarescu	Maximizing Bandwidth Using Disjoint Paths.	AINA	2010	DBLP DOI BibTeX RDF	maximum bandwidth, path bandwidth, edge-disjoint paths, network bandwidth, network QoS
1	Ken-ichi Kawarabayashi, Bruce A. Reed	Odd cycle packing.	STOC	2010	DBLP DOI BibTeX RDF	odd cycle, packing
1	Sun-Yuan Hsieh, Chang-Jen Tu	Constructing edge-disjoint spanning trees in locally twisted cubes.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Paul A. Catlin, Hong-Jian Lai, Yehong Shao	Edge-connectivity and edge-disjoint spanning trees.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho	Edge-disjoint spanners in tori.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Werner Schwärzler	On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary.	Combinatorica	2009	DBLP DOI BibTeX RDF
1	Matthias Kriesell	Edge disjoint Steiner trees in graphs without large bridges.	Journal of Graph Theory	2009	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Edge-Disjoint Paths in Planar Graphs with Constant Congestion.	SIAM J. Comput.	2009	DBLP DOI BibTeX RDF
1	Ruen Chze Loh, Sieteng Soh, Mihai Lazarescu	An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints.	AINA	2009	DBLP DOI BibTeX RDF	multi-constrained edge disjoint paths, approximate algorithm, network reliability, network delay, Lagrange relaxation
1	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	A Note on Multiflows and Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Product multicommodity flow, Treewidth, Edge-disjoint paths
1	Chi-Geun Han	Survivable Networks.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Local search, Network design, Survivability, Node-disjoint path, Edge-disjoint path
1	Aref Meddeb, Abdelwahed Berguiga, Habib Youssef	Optimal VPN design: The ILEC/CLEC dilemma.	ISCC	2009	DBLP DOI BibTeX RDF
1	Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani	Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth	Convex Partitions with 2-Edge Connected Dual Graphs.	COCOON	2009	DBLP DOI BibTeX RDF
1	Jack Edmonds	Branching Systems.	IWOCA	2009	DBLP DOI BibTeX RDF
1	Elliot Anshelevich, Bugra Caskurlu	Price of Stability in Survivable Network Design.	SAGT	2009	DBLP DOI BibTeX RDF
1	Natalia Vanetik	Path packing and a related optimization problem.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Path packing, Multiflow, K-clutter
1	Adrian Kosowski	The maximum edge-disjoint paths problem in complete graphs.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Vahan V. Mkrtchyan, Vahe L. Musoyan, A. V. Tserunyan	On edge-disjoint pairs of matchings.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Alok Baveja	The fractional congestion bound for efficient edge disjoint routing.	Networks	2008	DBLP DOI BibTeX RDF