|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 276 occurrences of 158 keywords
|
|
|
Results
Found 281 publication records. Showing 281 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
94 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 10th International Conference on Parallel and Distributed Systems, ICPADS 2004, Newport Beach, CA, USA, July 7-9, 2004, pp. 65-72, 2004, IEEE Computer Society, 0-7695-2152-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
91 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations on Baseline Networks with Node-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 737-746, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
semipermutation, baseline network, link-disjoint paths, crosstalk-free, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths |
89 | Qian-Ping Gu, Shietung Peng |
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), June 3-6, 1996, Tokyo, Japan, Proceedings, pp. 98-105, 1996, IEEE Computer Society, 0-8186-7267-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
set-to-set node-disjoint paths, interconnection networks, graph theory, hypercubes, Graph algorithms, hypercube networks, undirect graphs, node-disjoint paths |
78 | 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 |
76 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(4), pp. 383-393, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange |
76 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 31st International Conference on Parallel Processing (ICPP 2002), 20-23 August 2002, Vancouver, BC, Canada, pp. 239-246, 2002, IEEE Computer Society, 0-7695-1677-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange |
75 | Ash Mohammad Abbas, Mansoor Alam, Bijendra Nath Jain |
Alleviating path correlation using directional antenna in node-disjoint multipath routing for mobile ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2007, Honolulu, Hawaii, USA, August 12-16, 2007, pp. 405-410, 2007, ACM, 978-1-59593-695-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
forbidden zone, node-disjoint multipath routing, path correlation, path independence, pseudo-directional antenna |
67 | Luo Liu, Laurie G. Cuthbert |
Qos in node-disjoint routing for ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PE-WASUN ![In: Proceedings of the 4th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2007, Chania, Crete Island, Greece, October 22, 2007, pp. 92-95, 2007, ACM, 978-1-59593-808-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
agent-based SLA management, multipath, node-disjoint |
67 | Xuefei Li, Laurie G. Cuthbert |
A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSWiM ![In: Proceedings of the 7th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2004, Venice, Italy, October 4-6, 2004, pp. 230-233, 2004, ACM, 1-58113-953-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
ad hoc networks, multipath routing, low overhead, node-disjoint |
59 | Dongxue Jin, Zhipeng Liu, Chonggun Kim |
A Packet Distribution Method for Energy Balancing on Node-Disjoint Multipath of MANETs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007. Proceedings, pp. 499-507, 2007, Springer, 978-3-540-74281-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
packet distribution, energy, Ad Hoc, multipath, node-disjoint |
59 | Hsien-Jone Hsieh, Dyi-Rong Duh |
Constructing Node-Disjoint Paths in Enhanced Pyramid Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia-Pacific Computer Systems Architecture Conference ![In: Advances in Computer Systems Architecture, 11th Asia-Pacific Conference, ACSAC 2006, Shanghai, China, September 6-8, 2006, Proceedings, pp. 380-386, 2006, Springer, 3-540-40056-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Enhanced pyramid networks, pyramid networks, fault-tolerance, interconnection networks, container, node-disjoint paths, wide diameter |
59 | Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami |
An Efficient Construction of Node Disjoint Paths in OTIS Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPT ![In: Advanced Parallel Processing Technologies, 7th International Symposium, APPT 2007, Guangzhou, China, November 22-23, 2007, Proceedings, pp. 180-189, 2007, Springer, 978-3-540-76836-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
59 | Ash Mohammad Abbas, Tehzeeb Ahmed Abbasi |
An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMSWARE ![In: Proceedings of the Second International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2007), January 7-12, 2007, Bangalore, India, 2007, IEEE, 1-4244-0614-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
57 | Ozgur Sinanoglu, Mehmet Hakan Karaata, Bader F. AlBdaiwi |
An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 59(7), pp. 995-999, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
inherent stabilization, Fault-tolerance, stabilization, hypercube networks, node-disjoint paths |
49 | Leqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda |
An Efficient Adaptive Routing Algorithm for the Faulty Star Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 11-13 December 1997, Seoul, Korea, Proceedings, pp. 82-87, 1997, IEEE Computer Society, 0-8186-8227-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
node-disjoint subgraph, fault-tolerance, adaptive routing, star graph, node-disjoint path |
49 | Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya |
Sublinear-Time Parallel Algorithms for Matching and Related Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 174-185, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
sublinear-time parallel algorithms, maximal node-disjoint paths, zero-one networks, matching, depth-first search, node-disjoint paths, combinatorial structure |
47 | Anand Srinivas, Eytan H. Modiano |
Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 11(4), pp. 401-417, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
distributed algorithmsa, energy efficiency, graph theory, wireless ad-hoc networks, multipath routing, disjoint paths |
47 | Anand Srinivas, Eytan H. Modiano |
Minimum energy disjoint path routing in wireless ad-hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking, MOBICOM 2003, 2003, San Diego, CA, USA, September 14-19, 2003, pp. 122-133, 2003, ACM, 1-58113-753-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
distributed algorithms, energy efficiency, wireless ad-hoc networks, multipath routing, disjoint paths, minimum energy |
46 | Qian-Ping Gu, Shietung Peng |
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. ![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. 761-768, 2000, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
multistage interconnection networks, Permutation routing, all-optical networks, node-disjoint paths, wavelength routing, BPC permutations |
46 | Mehmet Hakan Karaata, Rachid Hadid |
Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, pp. 789-790, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Chao-Lieh Chen, Jeng-Wei Lee, Jia-Ming Yang, Yau-Hwang Kuo |
Efficient and Load-Balance Overlay Multicast Scheme with Path Diversity for Video Streaming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUC ![In: Embedded and Ubiquitous Computing, International Conference, EUC 2007, Taipei, Taiwan, December 17-20, 2007, Proceedings, pp. 389-399, 2007, Springer, 978-3-540-77091-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hierarchical independent tree, path-disjoint, load-balance, overlay multicast, topology-aware, node-disjoint |
45 | Chi-Chang Chen, Jianer Chen |
Nearly Optimal One-to-Many Parallel Routing in Star Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(12), pp. 1196-1202, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
parallel routing, Interconnection network, shortest path, routing algorithm, node-disjoint paths, star network |
45 | Siuli Roy, Somprakash Bandyopadhyay, Tetsuro Ueda, Kazuo Hasuike |
Multipath Routing in Ad Hoc Wireless Networks with Omni Directional and Directional Antenna: A Comparative Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWDC ![In: Distributed Computing, Mobile and Wireless Computing 4th International Workshop, IWDC 2002, Calcutta, India, December 28-31, 2002, Proceedings, pp. 184-191, 2002, Springer, 3-540-00355-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Xuefei Li, Laurie G. Cuthbert |
Node-disjointness-based multipath routing for mobile ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PE-WASUN ![In: Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2004, Venezia, Italy, October 4, 2004, pp. 23-29, 2004, ACM, 1-58113-959-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
ad hoc networks, multipath routing, low overhead, node-disjoint |
43 | Yun Ge, Guojun Wang 0001, Jie Wu 0001 |
Node-Disjoint Multipath Routing with Group Mobility in MANETs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAS ![In: Fifth International Conference on Networking, Architecture, and Storage, NAS 2010, Macau, China, July 15-17, 2010, pp. 181-189, 2010, IEEE Computer Society, 978-0-7695-4134-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
zoning method, mobile ad-hoc networks, multipath routing, node-disjoint paths, group mobility |
43 | Chang-Woo Ahn, Sang-Hwa Chung, Tae-Hun Kim, Su-Young Kang |
A Node-Disjoint Multipath Routing Protocol Based on AODV in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Seventh International Conference on Information Technology: New Generations, ITNG 2010, Las Vegas, Nevada, USA, 12-14 April 2010, pp. 828-833, 2010, IEEE Computer Society, 978-0-7695-3984-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
MANET, AODV, Multipath Routing, transmission delay, Node-disjoint |
43 | Saeedeh Bakhshi, Hamid Sarbazi-Azad |
One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia, pp. 227-232, 2008, IEEE Computer Society, 978-0-7695-3125-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multi-computers, WK-recursive, Parallel routing, interconnection networks, node-disjoint paths |
43 | Xuefei Li, Laurie G. Cuthbert |
Stable Node-Disjoint Multipath Routing with Low Overhead in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: 12th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2004), 4-8 October 2004, Vollendam, The Netherlands, pp. 184-191, 2004, IEEE Computer Society, 0-7695-2251-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Seshu Madhavapeddy, Ivan Hal Sudborough |
A topological property of hypercubes: node disjoint paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, SPDP 1990, Dallas, Texas, USA, December 9-13, 1990., pp. 532-539, 1990, IEEE Computer Society, 0-8186-2087-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
42 | Khaled Day, Abdel Elah Al-Ayyoub |
Reliable Communication in Faulty Star Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts Proceedings, 2002, IEEE Computer Society, 0-7695-1573-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Fault tolerance, routing, distributed algorithm, star graph, node-disjoint paths |
41 | Nastooh Taheri Javan, Mehdi Dehghan 0001 |
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSN ![In: Mobile Ad-Hoc and Sensor Networks, Third International Conference, MSN 2007, Beijing, China, December 12-14, 2007, Proceedings, pp. 715-724, 2007, Springer, 978-3-540-77023-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Zone-Disjoint Paths, MANET, Routing Algorithms, Multi-Path Routing |
39 | Yanghua Xiao, Wentao Wu 0001, Wei Wang 0009, Zhenying He |
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 13th International Conference, DASFAA 2008, New Delhi, India, March 19-21, 2008. Proceedings, pp. 452-460, 2008, Springer, 978-3-540-78567-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Kenji Ishida, Yoshiaki Kakuda, Tohru Kikuno |
A routing protocol for finding two node-disjoint paths in computer networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 1995 International Conference on Network Protocols, ICNP 1995, November 7-10, 1995, Tokyo, Japan, pp. 340-, 1995, IEEE Computer Society, 0-8186-7216-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Sutaek Oh, Dongkyun Kim, Hyunwoo Kang, Hong-Jong Jeong |
SMSR: A Scalable Multipath Source Routing Protocol for Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UIC ![In: Ubiquitous Intelligence and Computing, 6th International Conference, UIC 2009, Brisbane, Australia, July 7-9, 2009. Proceedings, pp. 121-135, 2009, Springer, 978-3-642-02829-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Yun Ge, Guojun Wang 0001, Weijia Jia 0001, Yongming Xie |
Node-Disjoint Multipath Routing with Zoning Method in MANETs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, 25-27 Sept. 2008, Dalian, China, pp. 456-462, 2008, IEEE Computer Society, 978-0-7695-3352-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Ash Mohammad Abbas |
Scalability and Route Failure Time of a Hybrid Protocol for Identification of Node-Disjoint Paths in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Internet Technology, 5th International Conference, ICDCIT 2008, New Delhi, India, December 10-12, 2008. Proceedings, pp. 109-120, 2008, Springer, 978-3-540-89736-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Abhijit Saha, Shafqat Ur Rehman, Mikyung Kang, In-Hye Shin, Gyung-Leen Park, Junghoon Lee |
A Comparative Study of Directional Node-Disjoint Multipath Routing in Wireless Ad Hoc Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30 - July 3, 2008, Proceedings, Part II, pp. 419-432, 2008, Springer, 978-3-540-69840-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Unipath and Multipath Routing Protocols, Ad hoc Network, Wireless Network, Routing Protocols |
34 | Chu-Hsing Lin, Fuu-Cheng Jiang, Jen-Chieh Chang, Frode Eika Sandnes |
Node-Disjoint Alternative Dual-Path Routing for Data Salvation in Mobile Ad hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2008, Dunedin, Otago, New Zealand, 1-4 December 2008, pp. 342-349, 2008, IEEE Computer Society, 978-0-7695-3443-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Xuefei Li, Laurie G. Cuthbert |
On-demand Node-Disjoint Multipath Routing in Wireless Ad hoc Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: 29th Annual IEEE Conference on Local Computer Networks (LCN 2004), 16-18 November 2004, Tampa, FL, USA, Proceedings, pp. 419-420, 2004, IEEE Computer Society, 0-7695-2260-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Ali Asghar Khavasi, Nastooh Taheri Javan |
Using zone-disjoint multi-path routing algorithm for video transmission over ad-hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 877-882, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
video multi-path transmission, zone-disjoint paths, MANET, multi-path routing |
33 | Khaled Day, Abdel Elah Al-Ayyoub |
Minimal Fault Diameter for Highly Resilient Product Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(9), pp. 926-930, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fault tolerance, interconnection networks, node-disjoint paths, product networks, Fault diameter |
33 | Bin Liu, Fabrizio Lombardi, Wei-Kang Huang |
Testing programmable interconnect systems: an algorithmic approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, pp. 311-316, 2000, IEEE Computer Society, 0-7695-0887-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
programmable circuits, interconnected systems, programmable interconnect systems testing, algorithmic approach, programmable wiring networks, comprehensive fault model, network faults, open faults, switch faults, stuck-off faults, programming faults, minimal configuration number, node-disjoint path-sets, network adjacencies, post-processing algorithm, fault diagnosis, graphs, interconnections, fault detection, fault coverage, circuit analysis computing, stuck-at faults, switching, bridge faults, automatic test software, circuit testing, figure of merit, programming phases, stuck-on faults, short circuits |
33 | Khaled Day, Abdel Elah Al-Ayyoub |
Fault Diameter of k-ary n-cube Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(9), pp. 903-907, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter |
32 | Jie Wu 0001 |
An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 22(1-4), pp. 61-75, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
simulation, optimization, ad hoc wireless networks, multipath routing, dynamic source routing (DSR) |
31 | Deying Li 0001, Qinghua Zhu, Huiqiang Yang |
Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 483-493, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
k-inconnected many-to-one routing, fault-tolerant, wireless networks, heuristics |
30 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Multicommodity flow, well-linked terminals, and routing problems. ![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. 183-192, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths |
30 | Wei Cheng 0001, Kai Xing, Xiuzhen Cheng 0001, Xicheng Lu, Zexin Lu, Jinshu Su, Baosheng Wang, Yujun Liu |
Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, pp. 209-220, 2008, ACM, 978-1-60558-073-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multipath determinability, route recovery, wireless sensor networks, multipath routing |
30 | Srinivasan Ramasubramanian, Mithun Harkara, Marwan Krunz |
Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006, Proceedings, pp. 1026-1038, 2006, Springer, 3-540-34192-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Patrick McCarthy, Dan Grigoras |
Multipath Associativity Based Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WONS ![In: 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 19-21 January 2005, St. Moritz, Switzerland, pp. 60-69, 2005, IEEE Computer Society, 0-7695-2292-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Dan Gusfield, Satish Eddhu, Charles H. Langley |
Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 2nd IEEE Computer Society Bioinformatics Conference, CSB 2003, Stanford, CA, USA, August 11-14, 2003, pp. 363-374, 2003, IEEE Computer Society, 0-7695-2000-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | 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 |
|
30 | Hengheng Xie, Azzedine Boukerche, Antonio A. F. Loureiro |
A Multipath Video Streaming Solution for Vehicular Networks with Link Disjoint and Node-disjoint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 26(12), pp. 3223-3235, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
30 | 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 |
|
30 | Natarajan Meghanathan |
Stability and Hop Count of Node-Disjoint and Link-Disjoint Multi-path Routes in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WiMob ![In: Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2007, White Plains, New York, USA, 8-10 October 2007, Proceedings, pp. 42, 2007, IEEE Computer Society, 0-7695-2889-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | 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 |
27 | Giridhar Jayavelu, Srinivasan Ramasubramanian, Ossama Younis |
Maintaining colored trees for disjoint multipath routing under node failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(1), pp. 346-359, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
IP fast rerouting, colored trees, multipath routing |
27 | S. D. Madhu Kumar, Umesh Bellur |
Availability models for underlay aware overlay networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEBS ![In: Proceedings of the Second International Conference on Distributed Event-Based Systems, DEBS 2008, Rome, Italy, July 1-4, 2008, pp. 169-180, 2008, ACM, 978-1-60558-090-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
manifest and latent availability, reduced underlay, underlay, availability, overlay network, overlays, event based system |
26 | Ruei-Yu Wu, Gerard J. Chang, Gen-Huey Chen |
Node-disjoint paths in hierarchical hypercube networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006, IEEE. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Xuefei Li, Laurie G. Cuthbert |
Node-Disjoint Multipath Routing and Distributed Cross-Layer QoS Guarantees in Mobile Ad hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: Seventh International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD 2006), 19-20 June 2006, Las Vegas, Nevada, USA, pp. 243-248, 2006, IEEE Computer Society, 0-7695-2611-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | |
Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.09801, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
26 | Hiroki Nagashima, Kousuke Mouri, Keiichi Kaneko |
Node-to-node Disjoint Paths in Twisted Crossed Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAIT ![In: Proceedings of the 10th International Conference on Advances in Information Technology, IAIT 2018, Bangkok, Thailand, December 10-13, 2018, pp. 5:1-5:8, 2018, ACM, 978-1-4503-6568-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | David Kocik, Keiichi Kaneko |
Node-to-Node Disjoint Paths Problem in Möbius Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 100-D(8), pp. 1837-1843, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
26 | Endong Wang, Hongwei Wang, Jicheng Chen, Weifeng Gong, Fan Ni |
A Novel Node-to-Set Node-Disjoint Fault-Tolerant Routing Strategy in Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACA ![In: Advanced Computer Architecture - 10th Annual Conference, ACA 2014, Shenyang, China, August 23-24, 2014. Proceedings, pp. 58-67, 2014, Springer, 978-3-662-44490-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine |
Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011, Tainan, Taiwan, December 7-9, 2011, pp. 181-187, 2011, IEEE Computer Society, 978-1-4577-1875-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Shuchita Upadhayaya, Charu Gandhi |
Node Disjoint Multipath Routing Considering Link and Node Stability protocol: A characteristic Evaluation ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1002.1162, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
26 | Keiichi Kaneko, Naoki Sawada |
An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 90-D(1), pp. 306-313, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Ke Qiu 0001, Selim G. Akl |
On Node-to-Node Disjoint Paths in the Star Interconnection Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IASTED PDCS ![In: International Conference on Parallel and Distributed Computing Systems, PDCS 2005, November 14-16, 2005, Phoenix, AZ, USA, pp. 731-735, 2005, IASTED/ACTA Press, 0-88986-525-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
25 | 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 |
|
25 | 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 |
25 | Qian-Ping Gu, Shietung Peng |
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 46(9), pp. 1042-1049, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
node fault tolerant routing, algorithms, Interconnection networks, node-disjoint paths |
25 | Khaled Day, Anand R. Tripathi |
Embedding of Cycles in Arrangement Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(8), pp. 1002-1006, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
cycles embeddings, large multiprocessor systems, node disjoint cycles, multiprocessor interconnection networks, Hamiltonian cycles, interconnection topology, arrangement graphs |
25 | Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu |
Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(5), pp. 612-616, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
de Bruijn digraphs, digraph iterations, connectivity analysis, optimal general theorem, optimal bounds, length-bound disjoint paths, graph theory, iterative methods, directed graphs, node-disjoint paths, Kautz graphs |
24 | Nicolas Beldiceanu, Xavier Lorca |
Necessary Condition for Path Partitioning Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings, pp. 141-154, 2007, Springer, 978-3-540-72396-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Claus-Peter Schnorr |
On Maximal Merging of Information in Boolean Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29 - August 2, 1974, Proceedings, pp. 294-300, 1974, Springer, 3-540-06841-4. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
23 | Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami |
Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 20(3), pp. 361-366, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
23 | Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto |
Optimal Broadcasting in Almost Trees and Partial k-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 432-443, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Qian-Ping Gu, Shietung Peng |
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ![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. 342-350, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
22 | Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman |
Finding disjoint paths with related path costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 12(1-2), pp. 83-96, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Frank K. Hwang, Wen-Dar Lin |
A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 30th International Workshops on Parallel Processing (ICPP 2001 Workshops), 3-7 September 2001, Valencia, Spain, pp. 297-301, 2001, IEEE Computer Society, 0-7695-1260-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | 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 |
|
19 | Bing Yang 0001, S. Q. Zheng 0001, Enyue Lu |
Finding Two Disjoint Paths in a Network with Normalized alpha+-MIN-SUM Objective Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 954-963, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | 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 |
|
19 | 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 |
|
19 | Andreas Jakoby, Maciej Liskiewicz |
Paths Problems in Symmetric Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 269-280, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Luciano Bononi, Marco Di Felice, Antonella Molinaro, Sara Pizzi |
Joint Channel Assignment and Multi-path Routing for Multi-radio Wireless Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 29th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2009 Workshops), 22-26 June 2009, Montreal, Québec, Canada, pp. 476-481, 2009, IEEE Computer Society, 978-0-7695-3660-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Nicolas Beldiceanu, Pierre Flener, Xavier Lorca |
Combining Tree Partitioning, Precedence, and Incomparability Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 13(4), pp. 459-489, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem |
18 | Vincent Toubiana, Houda Labiod, Laurent Reynaud, Yvon Gourhant |
Performance comparison of multipath reactive Ad hoc routing protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PIMRC ![In: Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008, 15-18 September 2008, Cannes, French Riviera, France, pp. 1-6, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang |
Buy-at-Bulk Network Design with Protection. ![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. 634-644, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Zhi Zhang, Guanzhong Dai, Dejun Mu |
Bandwidth-Aware Multipath Routing Protocol for Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UIC ![In: Ubiquitous Intelligence and Computing, Third International Conference, UIC 2006, Wuhan, China, September 3-6, 2006, Proceedings, pp. 322-330, 2006, Springer, 3-540-38091-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Xin Zhao 0002, Chun Tung Chou, Jun Guo 0001, Sanjay K. Jha |
Protecting Multicast Sessions in Wireless Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: LCN 2006, The 31st Annual IEEE Conference on Local Computer Networks, Tampa, Florida, USA, 14-16 November 2006, pp. 467-474, 2006, IEEE Computer Society, 1-4244-0418-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Hyosun Ko, Shahram Latifi, Pradip K. Srimani |
Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(3), pp. 247-260, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
multicasting, Broadcasting, hypercubes, wormhole routing, hamming codes, perfect codes |
18 | Sangamesh C. Jalade, Nagaraj B. Patil |
Adaptive deep Runge Kutta Garson's network with node disjoint local repair protocol based multipath routing in MANET. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Evol. Syst. ![In: Evol. Syst. 14(6), pp. 1045-1069, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Guangyu Li, Lin Chen |
Finding Node-disjoint Paths Resilient to Channel Failures in Multi-channel Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Fall ![In: 98th IEEE Vehicular Technology Conference, VTC Fall 2023, Hong Kong, SAR, China, October 10-13, 2023, pp. 1-6, 2023, IEEE, 979-8-3503-2928-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Maria Samonaki, Cristian Bermudez Serna, Carmen Mas Machuca |
Survivable Node-Disjoint Routing in Multi-Domain Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: IEEE International Conference on Communications, ICC 2023, Rome, Italy, May 28 - June 1, 2023, pp. 4578-4583, 2023, IEEE, 978-1-5386-7462-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Shuai Liu 0002, Yan Wang 0078, Jianxi Fan, Baolei Cheng |
Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP (3) ![In: Algorithms and Architectures for Parallel Processing - 23rd International Conference, ICA3PP 2023, Tianjin, China, October 20-22, 2023, Proceedings, Part III, pp. 40-56, 2023, Springer, 978-981-97-0797-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Xiaohong Xue, Shurong Zhang |
Minsum node-disjoint paths with time-varying delay functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Emergent Distributed Syst. ![In: Int. J. Parallel Emergent Distributed Syst. 37(4), pp. 398-412, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Ashutosh Sharma, Lokesh Tharani |
Ant Colony Based Node Disjoint Local Repair in Multipath Routing in MANET Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Pers. Commun. ![In: Wirel. Pers. Commun. 127(1), pp. 159-186, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Mahsa MalekiTabar, Amir Masoud Rahmani |
A delay-constrained node-disjoint multipath routing in software-defined vehicular networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Peer-to-Peer Netw. Appl. ![In: Peer-to-Peer Netw. Appl. 15(3), pp. 1452-1472, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat |
Almost Polynomial Hardness of Node-Disjoint Paths in Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. ![In: Theory Comput. 17, pp. 1-57, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
Displaying result #1 - #100 of 281 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ >>] |
|