|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 236 occurrences of 143 keywords
|
|
|
Results
Found 526 publication records. Showing 526 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
85 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman |
Algorithms for fault-tolerant routing in circuit switched networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 265-274, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths |
75 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Odd cycle packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 695-704, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
odd cycle, packing |
75 | Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki |
Finding Edge-Disjoint Paths in Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 26(1), pp. 3-30, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth |
75 | Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki |
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 203-212, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree |
63 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-disjoint paths in Planar graphs with constant congestion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 757-766, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Planar graphs, multicommodity flow, edge-disjoint paths |
63 | Qian-Ping Gu, Hisao Tamaki |
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 561-567, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
algorithm, Permutation routing, edge-disjoint paths, circuit-switched networks |
59 | Torsten Tholey |
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(1), pp. 51-78, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
59 | Torsten Tholey |
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 350-361, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
58 | Peng Zhang 0008, Wenbo Zhao 0001 |
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 70-81, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Matthew Andrews, Lisa Zhang |
Logarithmic hardness of the undirected edge-disjoint paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 745-761, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hardness of approximation, undirected graphs, edge-disjoint paths |
54 | Matthew Andrews, Lisa Zhang |
Hardness of the undirected edge-disjoint paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 276-283, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hardness of approximation, undirected graphs, edge-disjoint paths |
53 | Mohammad R. Salavatipour, Jacques Verstraëte |
Disjoint Cycles: Integrality Gap, Hardness, and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, pp. 51-65, 2005, Springer, 3-540-26199-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Myung M. Bae, Bella Bose |
Edge Disjoint Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 52(10), pp. 1271-1284, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Lee distance Gray codes, binary Gray codes, hypercube, Hamiltonian cycle, k-ary n-cubes, Lee distance |
50 | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster |
Approximation algorithms and hardness results for cycle packing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 48, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap |
49 | Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu, Suresh Rai |
A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRDC ![In: 14th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2008, 15-17 December 2008, Taipei, Taiwan, pp. 216-223, 2008, IEEE Computer Society, 978-0-7695-3448-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Chandra Chekuri, Sanjeev Khanna |
Edge-disjoint paths revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 46, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths |
48 | Mingji Xia |
Maximum Edge-Disjoint Paths Problem in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 566-572, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
maximum edge-disjoint paths, #P-hard, determinant |
48 | Jan M. Hochstein, Karsten Weihe |
Edge-disjoint routing in plane switch graphs in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(4), pp. 636-670, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Planar graphs, edge-disjoint paths |
48 | Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung |
Constructing Edge-Disjoint Spanning Trees in Product Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(3), pp. 213-221, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Cartesian product networks, edge-disjoint trees, fault-tolerance, interconnection networks, embedding, spanning trees |
48 | Aravind Srinivasan |
Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 416-425, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
multi-commodity flow relaxation, multiprocessor interconnection networks, edge-disjoint paths, unsplittable flow, routing problems |
47 | Paraskevi Fragopoulou, Selim G. Akl |
Fault tolerant communication algorithms on the star network using disjoint paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 4-13, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
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 |
45 | Zachary Friggstad, Mohammad R. Salavatipour |
Approximability of Packing Disjoint Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 304-315, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang |
Broadcasting on incomplete hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 826-833, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
44 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 1-14, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Andreas Schwill |
Shorest Edge-Disjoint Paths in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings, pp. 505-516, 1989, Springer, 3-540-50840-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
43 | Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang |
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 226-244, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Arch D. Robison |
A group of permutations with edge-disjoint paths on hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 746-749, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
41 | Pallavi Manohar, V. Sridhar |
Routing, Wavelength Assignment in Optical Networks Using an Efficient and Fair EDP Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part III, pp. 1178-1184, 2004, Springer, 3-540-22116-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Edge Disjoint Path Algorithms, Optical Networks, Routing and Wavelength Assignment |
41 | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 455-464, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
40 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 71-80, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Satish Rao, Shuheng Zhou |
Edge Disjoint Paths in Moderately Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 202-213, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Paraskevi Fragopoulou, Selim G. Akl |
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 45(2), pp. 174-185, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
edge-disjoint trees, fault tolerance, parallel algorithm, interconnection network, spanning tree, star network, Communication algorithm |
38 | Naoki Katoh, Shin-ichi Tanigawa |
A proof of the molecular conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 296-305, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bar-and-joint frameworks, body-and-hinge frameworks, edge-disjoint spanning trees, the molecular conjecture, rigidity |
38 | Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad |
Paths and Trails in Edge-Colored Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 723-735, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
properly edge-colored paths, trails and cycles, connectivity, Edge colored graphs |
38 | Spyros Tragoudas, Yaakov L. Varol |
Computing Disjoint Path with Lenght Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 375-389, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
34 | Dirk Müller 0003 |
On the complexity of the planar directed edge-disjoint paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 275-288, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C38, 68Q17, 68R10, 90C35 |
34 | Chien-Hung Huang, Jywe-Fei Fang, Chin-Yang Yang |
Edge-Disjoint Hamiltonian Cycles of WK-Recursive Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing, State of the Art in Scientific Computing, 7th International Workshop, PARA 2004, Lyngby, Denmark, June 20-23, 2004, Revised Selected Papers, pp. 1099-1104, 2004, Springer, 3-540-29067-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Maria J. Blesa, Christian Blum 0001 |
Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Coimbra, Portugal, April 5-7, 2004, Proceedings, pp. 160-169, 2004, Springer, 3-540-21378-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Hyunseung Choo, Vladimir V. Shakhov |
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part III, pp. 1138-1145, 2004, Springer, 3-540-22116-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | R. Sai Anand, Thomas Erlebach |
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pp. 584-597, 2002, Springer, 3-540-43400-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Thomas Erlebach, Klaus Jansen |
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 195-206, 2000, Springer, 3-540-42512-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Hrushikesha Mohanty, G. P. Bhattacharjee |
A Distributed Algorithm for Edge-Disjoint Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 344-361, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
32 | Jeongsoo Han |
Network-Adaptive QoS Routing Using Local Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APNOMS ![In: Management of Convergence Networks and Services, 9th Asia-Pacific Network Operations and Management Symposium, APNOMS 2006 Busan, Korea, September 27-29, 2006, Proceedings, pp. 190-199, 2006, Springer, 3-540-45776-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Localized Adaptive QoS Routing, Exploration Bonus, Certainty Equivalency Approximation, Edge-disjoint multi-path, Reinforcement Learning, POMDP |
32 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
The all-or-nothing multicommodity flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 156-165, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths |
32 | Qian-Ping Gu, Shietung Peng |
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the 2000 International Conference on Parallel Processing, ICPP 2000, Toronto, Canada, August 21-24, 2000, pp. 513-520, 2000, IEEE Computer Society, 0-7695-0768-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
WDM all-optical networks, routing algorithms, multistage interconnection networks, Permutation routing, edge-disjoint paths, BPC permutations |
32 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks |
On the totalk-diameter of connection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 96-106, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
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 |
32 | Torsten Tholey |
Finding Disjoint Paths on Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 319-330, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Marwan Al-Jubeh, Michael Hoffmann 0001, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth |
Convex Partitions with 2-Edge Connected Dual Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 192-204, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Lap Chi Lau |
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(1), pp. 71-90, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40 |
30 | Lap Chi Lau |
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 61-70, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman |
Short length menger's theorem and reliable optical routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 246-247, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
flow number, menger's theorem, fault-tolerant routing, path coloring |
29 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(1), pp. 21-43, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems |
28 | Lenwood S. Heath, John Paul C. Vergara |
Edge-Packing in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 31(6), pp. 629-662, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Adrian Kosowski |
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 130-142, 2006, Springer, 3-540-35474-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Li Yang |
Building k Edge-Disjoint Spanning Trees of Minimum Total Length for Isometric Data Embedding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 27(10), pp. 1680-1683, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
dimensionality reduction, minimum spanning tree, manifold learning, Data embedding, neighborhood graph |
28 | Chandra Chekuri, Sanjeev Khanna |
Edge disjoint paths revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 628-637, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
28 | Aleksandrs Slivkins |
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 482-493, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, Frances A. Rosamond |
Clustering with Partial Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 144-155, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Joseph Cheriyan, Adrian Vetta |
Approximation algorithms for network design with metric costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 167-175, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
metric costs, approximation algorithms, graph connectivity |
28 | András Frank, Zoltán Király |
Graph Orientations with Edge-connection and Parity Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(1), pp. 47-70, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C75, 05C40 |
28 | András Frank, Zoltán Király |
Parity Constrained k-Edge-Connected Orientations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 191-201, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Yi-Zhi Xu, Ho Fai Po, Chi Ho Yeung, David Saad |
Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.00609, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Zbigniew R. Bogdanowicz |
Arc-Disjoint and Edge-Disjoint Hamilton Cycles in Circulants with Two Jumps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 29(2), pp. 165-171, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
27 | Ruo-Wei Hung |
Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1006.3909, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
27 | Robin W. Whitty |
Vertex-disjoint paths and edge-disjoint branchings in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 11(3), pp. 349-358, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
25 | Koichi Wada 0001, Akinari Takaki, Kimio Kawaguchi |
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 319-330, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Markus Maier, Steffen Mecke, Dorothea Wagner |
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 410-421, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Chuan-Ching Sue, Min-Shao Shieh, Chin-Yu Huang |
Dependable WDM networks with reconfigurable edge-disjoint p-cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITRE ![In: ITRE 2005 - 3rd International Conference on Information Technology: Research and Education, June 27-30 2005, Hsinchu, Taiwan, Proceedings, pp. 126-130, 2005, IEEE, 0-7803-8933-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Chuan-Ching Sue, Yung-Chiao Chen, Min-Shao Shieh, Sy-Yen Kuo |
Dependable WDM Networks with Edge-Disjoint P-Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, Second InternationalSymposium, ISPA 2004, Hong Kong, China, December 13-15, 2004, Proceedings, pp. 804-814, 2004, Springer, 3-540-24128-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Luke Mathieson, Elena Prieto-Rodriguez, Peter Shaw 0001 |
Packing Edge Disjoint Triangles: A Parameterized View. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 127-137, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Paz Carmi, Thomas Erlebach, Yoshio Okamoto |
Greedy Edge-Disjoint Paths in Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 143-155, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Shortening lemma, Approximation algorithm, Greedy algorithm |
25 | Myung Hee Kim, Hyunseung Choo, Byung Ho Yae, Jonghyun Lee |
A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Human.Society@Internet 2003 ![In: Web Communication Technologies and Internet-Related Social Issues - HSI 2003, Second International Conference on Human Society@Internet, Seoul, Korea, June 18-20, 2003, Proceedings, pp. 138-147, 2003, Springer, 3-540-40456-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Myung M. Bae, Bella Bose |
Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), Cancun, Mexico, May 1-5, 2000, pp. 365-370, 2000, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Karsten Weihe |
Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 330-340, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Graph algorithms, planar graphs, disjoint paths |
25 | Xiao Zhou 0001, Takao Nishizeki |
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 417-426, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | C. P. Gopalakrishnan, C. Pandu Rangan |
Edge-Disjoint Paths in Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 208-216, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Karsten Weihe |
Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 130-140, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener |
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings, pp. 219-230, 1994, Springer, 3-540-58218-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
parallel computations, communication algorithms |
25 | Dorothea Wagner, Karsten Weihe |
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 384-395, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
25 | H. Narayanan, Huzur Saran, Vijay V. Vazirani |
Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 357-366, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
24 | Egon Wanke, Rolf Kötter |
Oriented Paths in Mixed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 629-643, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Noga Alon, Michael R. Capalbo |
Finding Disjoint Paths in Expanders Deterministically and Online. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 518-524, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Lap Chi Lau |
Packing Steiner Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, pp. 362-376, 2005, Springer, 3-540-26199-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 180-191, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana |
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 35(6), pp. 641-665, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis |
Trade-Offs between Density and Robustness in Random Interconnection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 152-168, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Nihar R. Mahapatra, Shantanu Dutt |
Efficient Network-Flow Based Techniques for Dynamic Fault Reconfiguration in FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTCS ![In: Digest of Papers: FTCS-29, The Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing, Madison, Wisconsin, USA, June 15-18, 1999, pp. 122-129, 1999, IEEE Computer Society, 0-7695-0213-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu |
Maximizing Bandwidth Using Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010, Perth, Australia, 20-13 April 2010, pp. 304-311, 2010, IEEE Computer Society, 978-0-7695-4018-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
maximum bandwidth, path bandwidth, edge-disjoint paths, network bandwidth, network QoS |
23 | Chi-Geun Han |
Survivable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 3889-3892, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Local search, Network design, Survivability, Node-disjoint path, Edge-disjoint path |
23 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
A Note on Multiflows and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(3), pp. 400-412, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Product multicommodity flow, Treewidth, Edge-disjoint paths |
23 | Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu |
An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: The IEEE 23rd International Conference on Advanced Information Networking and Applications, AINA 2009, Bradford, United Kingdom, May 26-29, 2009, pp. 959-964, 2009, IEEE Computer Society, 978-0-7695-3638-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
multi-constrained edge disjoint paths, approximate algorithm, network reliability, network delay, Lagrange relaxation |
23 | Bin Wang, Xiao-Min Li, Lan Lei |
A Degree-Condition for ( s , t )-Supereulerian Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 381-383, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
(s, t)-supereulerian, Reduced Graph, Edge-disjoint Spanning Trees, Collapsible |
23 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 165-178, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
23 | Stavros G. Kolliopoulos, Clifford Stein 0001 |
Approximating disjoint-path problems using packing integer programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 99(1), pp. 63-87, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
packing integer programs, approximation algorithms, edge-disjoint paths |
23 | Hee Yong Youn, Jae Young Lee |
An Efficient Dictionary Machine Using Hexagonal Processor Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(3), pp. 266-273, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
edge disjoint embedding, update and query, processor array, hexagonal mesh, Dictionary machine |
23 | Emmanouel A. Varvarigos, Ayan Banerjee |
Routing Schemes for Multiple Random Broadcasts in Arbitrary Network Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(8), pp. 886-895, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
edge-disjoint trees, dynamic broadcasting, queuing systems, General graphs |
23 | Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang |
Broadcasting on Incomplete Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(11), pp. 1393-1398, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
edge-disjoint spanning trees, delays, hypercube networks, trees (mathematics), broadcasting algorithm, incomplete hypercube, faulty nodes |
23 | Samir Khuller, Baruch Schieber |
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 288-293, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM |
22 | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
Approximating Minimum-Power Degree and Connectivity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 423-435, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Yefim Dinitz, Ronit Nossenson |
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 272-285, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 526 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ >>] |
|