The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Node-disjoint (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1974-1995 (16) 1996-1998 (15) 1999-2001 (16) 2002-2003 (21) 2004 (15) 2005 (19) 2006 (18) 2007 (24) 2008 (24) 2009 (16) 2010-2011 (17) 2012-2013 (17) 2014-2015 (21) 2016-2017 (17) 2018-2021 (18) 2022-2023 (7)
Publication types (Num. hits)
article(109) incollection(1) inproceedings(171)
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
94Yuanyuan Yang 0001, Jianchao Wang Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths. Search on Bibsonomy ICPADS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
91Yuanyuan Yang 0001, Jianchao Wang Routing Permutations on Baseline Networks with Node-Disjoint Paths. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF semipermutation, baseline network, link-disjoint paths, crosstalk-free, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths
89Qian-Ping Gu, Shietung Peng An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. Search on Bibsonomy ICPADS The full citation details ... 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
78Ken-ichi Kawarabayashi, Bruce A. Reed Odd cycle packing. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF odd cycle, packing
76Yuanyuan Yang 0001, Jianchao Wang Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 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
76Yuanyuan Yang 0001, Jianchao Wang Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Networks. Search on Bibsonomy ICPP The full citation details ... 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
75Ash 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 IWCMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF forbidden zone, node-disjoint multipath routing, path correlation, path independence, pseudo-directional antenna
67Luo Liu, Laurie G. Cuthbert Qos in node-disjoint routing for ad hoc networks. Search on Bibsonomy PE-WASUN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF agent-based SLA management, multipath, node-disjoint
67Xuefei Li, Laurie G. Cuthbert A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks. Search on Bibsonomy MSWiM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF ad hoc networks, multipath routing, low overhead, node-disjoint
59Dongxue Jin, Zhipeng Liu, Chonggun Kim A Packet Distribution Method for Energy Balancing on Node-Disjoint Multipath of MANETs. Search on Bibsonomy ICIC (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF packet distribution, energy, Ad Hoc, multipath, node-disjoint
59Hsien-Jone Hsieh, Dyi-Rong Duh Constructing Node-Disjoint Paths in Enhanced Pyramid Networks. Search on Bibsonomy Asia-Pacific Computer Systems Architecture Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Enhanced pyramid networks, pyramid networks, fault-tolerance, interconnection networks, container, node-disjoint paths, wide diameter
59Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami An Efficient Construction of Node Disjoint Paths in OTIS Networks. Search on Bibsonomy APPT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
59Ash 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 COMSWARE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
57Ozgur 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 IEEE Trans. Computers The full citation details ... 2010 DBLP  DOI  BibTeX  RDF inherent stabilization, Fault-tolerance, stabilization, hypercube networks, node-disjoint paths
49Leqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda An Efficient Adaptive Routing Algorithm for the Faulty Star Graph. Search on Bibsonomy ICPADS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF node-disjoint subgraph, fault-tolerance, adaptive routing, star graph, node-disjoint path
49Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya Sublinear-Time Parallel Algorithms for Matching and Related Problems Search on Bibsonomy FOCS The full citation details ... 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
47Anand Srinivas, Eytan H. Modiano Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks. Search on Bibsonomy Wirel. Networks The full citation details ... 2005 DBLP  DOI  BibTeX  RDF distributed algorithmsa, energy efficiency, graph theory, wireless ad-hoc networks, multipath routing, disjoint paths
47Anand Srinivas, Eytan H. Modiano Minimum energy disjoint path routing in wireless ad-hoc networks. Search on Bibsonomy MobiCom The full citation details ... 2003 DBLP  DOI  BibTeX  RDF distributed algorithms, energy efficiency, wireless ad-hoc networks, multipath routing, disjoint paths, minimum energy
46Qian-Ping Gu, Shietung Peng Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. Search on Bibsonomy IPDPS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF multistage interconnection networks, Permutation routing, all-optical networks, node-disjoint paths, wavelength routing, BPC permutations
46Mehmet Hakan Karaata, Rachid Hadid Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks. Search on Bibsonomy SSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
45Chao-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 EUC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF hierarchical independent tree, path-disjoint, load-balance, overlay multicast, topology-aware, node-disjoint
45Chi-Chang Chen, Jianer Chen Nearly Optimal One-to-Many Parallel Routing in Star Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF parallel routing, Interconnection network, shortest path, routing algorithm, node-disjoint paths, star network
45Siuli 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 IWDC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
43Xuefei Li, Laurie G. Cuthbert Node-disjointness-based multipath routing for mobile ad hoc networks. Search on Bibsonomy PE-WASUN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF ad hoc networks, multipath routing, low overhead, node-disjoint
43Yun Ge, Guojun Wang 0001, Jie Wu 0001 Node-Disjoint Multipath Routing with Group Mobility in MANETs. Search on Bibsonomy NAS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF zoning method, mobile ad-hoc networks, multipath routing, node-disjoint paths, group mobility
43Chang-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 ITNG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF MANET, AODV, Multipath Routing, transmission delay, Node-disjoint
43Saeedeh Bakhshi, Hamid Sarbazi-Azad One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks. Search on Bibsonomy ISPAN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multi-computers, WK-recursive, Parallel routing, interconnection networks, node-disjoint paths
43Xuefei Li, Laurie G. Cuthbert Stable Node-Disjoint Multipath Routing with Low Overhead in Mobile Ad Hoc Networks. Search on Bibsonomy MASCOTS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
43Seshu Madhavapeddy, Ivan Hal Sudborough A topological property of hypercubes: node disjoint paths. Search on Bibsonomy SPDP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
42Khaled Day, Abdel Elah Al-Ayyoub Reliable Communication in Faulty Star Networks. Search on Bibsonomy IPDPS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Fault tolerance, routing, distributed algorithm, star graph, node-disjoint paths
41Nastooh Taheri Javan, Mehdi Dehghan 0001 Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks. Search on Bibsonomy MSN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Zone-Disjoint Paths, MANET, Routing Algorithms, Multi-Path Routing
39Yanghua Xiao, Wentao Wu 0001, Wei Wang 0009, Zhenying He Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination. Search on Bibsonomy DASFAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
37Kenji Ishida, Yoshiaki Kakuda, Tohru Kikuno A routing protocol for finding two node-disjoint paths in computer networks. Search on Bibsonomy ICNP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
36Sutaek Oh, Dongkyun Kim, Hyunwoo Kang, Hong-Jong Jeong SMSR: A Scalable Multipath Source Routing Protocol for Wireless Sensor Networks. Search on Bibsonomy UIC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
34Yun Ge, Guojun Wang 0001, Weijia Jia 0001, Yongming Xie Node-Disjoint Multipath Routing with Zoning Method in MANETs. Search on Bibsonomy HPCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Ash 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 ICDCIT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Abhijit 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 ICCSA (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Unipath and Multipath Routing Protocols, Ad hoc Network, Wireless Network, Routing Protocols
34Chu-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 PDCAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Xuefei Li, Laurie G. Cuthbert On-demand Node-Disjoint Multipath Routing in Wireless Ad hoc Network. Search on Bibsonomy LCN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Ali Asghar Khavasi, Nastooh Taheri Javan Using zone-disjoint multi-path routing algorithm for video transmission over ad-hoc networks. Search on Bibsonomy ICIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF video multi-path transmission, zone-disjoint paths, MANET, multi-path routing
33Khaled Day, Abdel Elah Al-Ayyoub Minimal Fault Diameter for Highly Resilient Product Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF fault tolerance, interconnection networks, node-disjoint paths, product networks, Fault diameter
33Bin Liu, Fabrizio Lombardi, Wei-Kang Huang Testing programmable interconnect systems: an algorithmic approach. Search on Bibsonomy Asian Test Symposium The full citation details ... 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
33Khaled Day, Abdel Elah Al-Ayyoub Fault Diameter of k-ary n-cube Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter
32Jie Wu 0001 An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF simulation, optimization, ad hoc wireless networks, multipath routing, dynamic source routing (DSR)
31Deying Li 0001, Qinghua Zhu, Huiqiang Yang Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF k-inconnected many-to-one routing, fault-tolerant, wireless networks, heuristics
30Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Multicommodity flow, well-linked terminals, and routing problems. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths
30Wei 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 MobiHoc The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multipath determinability, route recovery, wireless sensor networks, multipath routing
30Srinivasan Ramasubramanian, Mithun Harkara, Marwan Krunz Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing. Search on Bibsonomy Networking The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Patrick McCarthy, Dan Grigoras Multipath Associativity Based Routing. Search on Bibsonomy WONS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Dan Gusfield, Satish Eddhu, Charles H. Langley Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. Search on Bibsonomy CSB The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Yi-Zhi Xu, Ho Fai Po, Chi Ho Yeung, David Saad Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
30Hengheng Xie, Azzedine Boukerche, Antonio A. F. Loureiro A Multipath Video Streaming Solution for Vehicular Networks with Link Disjoint and Node-disjoint. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
30Ruo-Wei Hung Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
30Natarajan Meghanathan Stability and Hop Count of Node-Disjoint and Link-Disjoint Multi-path Routes in Ad Hoc Networks. Search on Bibsonomy WiMob The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Joseph Cheriyan, Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems
27Giridhar Jayavelu, Srinivasan Ramasubramanian, Ossama Younis Maintaining colored trees for disjoint multipath routing under node failures. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF IP fast rerouting, colored trees, multipath routing
27S. D. Madhu Kumar, Umesh Bellur Availability models for underlay aware overlay networks. Search on Bibsonomy DEBS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF manifest and latent availability, reduced underlay, underlay, availability, overlay network, overlays, event based system
26Ruei-Yu Wu, Gerard J. Chang, Gen-Huey Chen Node-disjoint paths in hierarchical hypercube networks. Search on Bibsonomy IPDPS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Xuefei Li, Laurie G. Cuthbert Node-Disjoint Multipath Routing and Distributed Cross-Layer QoS Guarantees in Mobile Ad hoc Networks. Search on Bibsonomy SNPD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26 Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
26Hiroki Nagashima, Kousuke Mouri, Keiichi Kaneko Node-to-node Disjoint Paths in Twisted Crossed Cubes. Search on Bibsonomy IAIT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
26David Kocik, Keiichi Kaneko Node-to-Node Disjoint Paths Problem in Möbius Cubes. Search on Bibsonomy IEICE Trans. Inf. Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
26Endong 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 ACA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
26Yonghong Xiang, Iain A. Stewart, Florent R. Madelaine Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges. Search on Bibsonomy ICPADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
26Shuchita Upadhayaya, Charu Gandhi Node Disjoint Multipath Routing Considering Link and Node Stability protocol: A characteristic Evaluation Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
26Keiichi Kaneko, Naoki Sawada An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs. Search on Bibsonomy IEICE Trans. Inf. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Ke Qiu 0001, Selim G. Akl On Node-to-Node Disjoint Paths in the Star Interconnection Network. Search on Bibsonomy IASTED PDCS The full citation details ... 2005 DBLP  BibTeX  RDF
25Ruen 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 PRDC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Chi-Geun Han Survivable Networks. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Local search, Network design, Survivability, Node-disjoint path, Edge-disjoint path
25Qian-Ping Gu, Shietung Peng k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1997 DBLP  DOI  BibTeX  RDF node fault tolerant routing, algorithms, Interconnection networks, node-disjoint paths
25Khaled Day, Anand R. Tripathi Embedding of Cycles in Arrangement Graphs. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1993 DBLP  DOI  BibTeX  RDF cycles embeddings, large multiprocessor systems, node disjoint cycles, multiprocessor interconnection networks, Hamiltonian cycles, interconnection topology, arrangement graphs
25Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 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
24Nicolas Beldiceanu, Xavier Lorca Necessary Condition for Path Partitioning Constraints. Search on Bibsonomy CPAIOR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
24Claus-Peter Schnorr On Maximal Merging of Information in Boolean Computations. Search on Bibsonomy ICALP The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
23Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Joseph Cheriyan, Adrian Vetta Approximation algorithms for network design with metric costs. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF metric costs, approximation algorithms, graph connectivity
23Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto Optimal Broadcasting in Almost Trees and Partial k-trees. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23Qian-Ping Gu, Shietung Peng k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
22Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman Finding disjoint paths with related path costs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22Frank K. Hwang, Wen-Dar Lin A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks. Search on Bibsonomy ICPP Workshops The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Nihar R. Mahapatra, Shantanu Dutt Efficient Network-Flow Based Techniques for Dynamic Fault Reconfiguration in FPGAs. Search on Bibsonomy FTCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
19Bing 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 ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Joseph Cheriyan, Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
19Andreas Jakoby, Maciej Liskiewicz Paths Problems in Symmetric Logarithmic Space. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
18Luciano Bononi, Marco Di Felice, Antonella Molinaro, Sara Pizzi Joint Channel Assignment and Multi-path Routing for Multi-radio Wireless Mesh Networks. Search on Bibsonomy ICDCS Workshops The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Nicolas Beldiceanu, Pierre Flener, Xavier Lorca Combining Tree Partitioning, Precedence, and Incomparability Constraints. Search on Bibsonomy Constraints An Int. J. The full citation details ... 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
18Vincent Toubiana, Houda Labiod, Laurent Reynaud, Yvon Gourhant Performance comparison of multipath reactive Ad hoc routing protocols. Search on Bibsonomy PIMRC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang Buy-at-Bulk Network Design with Protection. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Zhi Zhang, Guanzhong Dai, Dejun Mu Bandwidth-Aware Multipath Routing Protocol for Mobile Ad Hoc Networks. Search on Bibsonomy UIC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Xin Zhao 0002, Chun Tung Chou, Jun Guo 0001, Sanjay K. Jha Protecting Multicast Sessions in Wireless Mesh Networks. Search on Bibsonomy LCN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Hyosun Ko, Shahram Latifi, Pradip K. Srimani Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF multicasting, Broadcasting, hypercubes, wormhole routing, hamming codes, perfect codes
18Sangamesh 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 Evol. Syst. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
18Guangyu Li, Lin Chen Finding Node-disjoint Paths Resilient to Channel Failures in Multi-channel Wireless Networks. Search on Bibsonomy VTC Fall The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
18Maria Samonaki, Cristian Bermudez Serna, Carmen Mas Machuca Survivable Node-Disjoint Routing in Multi-Domain Networks. Search on Bibsonomy ICC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
18Shuai Liu 0002, Yan Wang 0078, Jianxi Fan, Baolei Cheng Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing. Search on Bibsonomy ICA3PP (3) The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
18Xiaohong Xue, Shurong Zhang Minsum node-disjoint paths with time-varying delay functions. Search on Bibsonomy Int. J. Parallel Emergent Distributed Syst. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
18Ashutosh Sharma, Lokesh Tharani Ant Colony Based Node Disjoint Local Repair in Multipath Routing in MANET Network. Search on Bibsonomy Wirel. Pers. Commun. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
18Mahsa MalekiTabar, Amir Masoud Rahmani A delay-constrained node-disjoint multipath routing in software-defined vehicular networks. Search on Bibsonomy Peer-to-Peer Netw. Appl. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
18Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat Almost Polynomial Hardness of Node-Disjoint Paths in Grids. Search on Bibsonomy Theory Comput. The full citation details ... 2021 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 281 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license