Search results for "Node-disjoint"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
94	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths.	ICPADS	2004	DBLP DOI BibTeX RDF
91	Yuanyuan Yang 0001, Jianchao Wang	Routing Permutations on Baseline Networks with Node-Disjoint Paths.	IEEE Trans. Parallel Distributed Syst.	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.	ICPADS	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.	STOC	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.	IEEE Trans. Parallel Distributed Syst.	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.	ICPP	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.	IWCMC	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.	PE-WASUN	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.	MSWiM	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.	ICIC (3)	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.	Asia-Pacific Computer Systems Architecture Conference	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.	APPT	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.	COMSWARE	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.	IEEE Trans. Computers	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.	ICPADS	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	FOCS	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.	Wirel. Networks	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.	MobiCom	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.	IPDPS	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.	SSS	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.	EUC	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.	IEEE Trans. Parallel Distributed Syst.	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.	IWDC	2002	DBLP DOI BibTeX RDF
43	Xuefei Li, Laurie G. Cuthbert	Node-disjointness-based multipath routing for mobile ad hoc networks.	PE-WASUN	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.	NAS	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.	ITNG	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.	ISPAN	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.	MASCOTS	2004	DBLP DOI BibTeX RDF
43	Seshu Madhavapeddy, Ivan Hal Sudborough	A topological property of hypercubes: node disjoint paths.	SPDP	1990	DBLP DOI BibTeX RDF
42	Khaled Day, Abdel Elah Al-Ayyoub	Reliable Communication in Faulty Star Networks.	IPDPS	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.	MSN	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.	DASFAA	2008	DBLP DOI BibTeX RDF
37	Kenji Ishida, Yoshiaki Kakuda, Tohru Kikuno	A routing protocol for finding two node-disjoint paths in computer networks.	ICNP	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.	UIC	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.	HPCC	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.	ICDCIT	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.	ICCSA (2)	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.	PDCAT	2008	DBLP DOI BibTeX RDF
34	Xuefei Li, Laurie G. Cuthbert	On-demand Node-Disjoint Multipath Routing in Wireless Ad hoc Network.	LCN	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.	ICIS	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.	IEEE Trans. Parallel Distributed Syst.	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.	Asian Test Symposium	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.	IEEE Trans. Parallel Distributed Syst.	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.	Telecommun. Syst.	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.	COCOA	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.	STOC	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.	MobiHoc	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.	Networking	2006	DBLP DOI BibTeX RDF
30	Patrick McCarthy, Dan Grigoras	Multipath Associativity Based Routing.	WONS	2005	DBLP DOI BibTeX RDF
30	Dan Gusfield, Satish Eddhu, Charles H. Langley	Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination.	CSB	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.	CoRR	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.	IEEE Trans. Parallel Distributed Syst.	2015	DBLP DOI BibTeX RDF
30	Ruo-Wei Hung	Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes	CoRR	2010	DBLP BibTeX RDF
30	Natarajan Meghanathan	Stability and Hop Count of Node-Disjoint and Link-Disjoint Multi-path Routes in Ad Hoc Networks.	WiMob	2007	DBLP DOI BibTeX RDF
28	Joseph Cheriyan, Mohammad R. Salavatipour	Hardness and Approximation Results for Packing Steiner Trees.	Algorithmica	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.	IEEE/ACM Trans. Netw.	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.	DEBS	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.	IPDPS	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.	SNPD	2006	DBLP DOI BibTeX RDF
26		Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks.	CoRR	2021	DBLP BibTeX RDF
26	Hiroki Nagashima, Kousuke Mouri, Keiichi Kaneko	Node-to-node Disjoint Paths in Twisted Crossed Cubes.	IAIT	2018	DBLP DOI BibTeX RDF
26	David Kocik, Keiichi Kaneko	Node-to-Node Disjoint Paths Problem in Möbius Cubes.	IEICE Trans. Inf. Syst.	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.	ACA	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.	ICPADS	2011	DBLP DOI BibTeX RDF
26	Shuchita Upadhayaya, Charu Gandhi	Node Disjoint Multipath Routing Considering Link and Node Stability protocol: A characteristic Evaluation	CoRR	2010	DBLP BibTeX RDF
26	Keiichi Kaneko, Naoki Sawada	An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs.	IEICE Trans. Inf. Syst.	2007	DBLP DOI BibTeX RDF
26	Ke Qiu 0001, Selim G. Akl	On Node-to-Node Disjoint Paths in the Star Interconnection Network.	IASTED PDCS	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.	PRDC	2008	DBLP DOI BibTeX RDF
25	Chi-Geun Han	Survivable Networks.	Encyclopedia of Optimization	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.	IEEE Trans. Computers	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.	IEEE Trans. Computers	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.	IEEE Trans. Computers	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.	CPAIOR	2007	DBLP DOI BibTeX RDF
24	Claus-Peter Schnorr	On Maximal Merging of Information in Boolean Computations.	ICALP	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.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
23	Joseph Cheriyan, Adrian Vetta	Approximation algorithms for network design with metric costs.	STOC	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.	STACS	1998	DBLP DOI BibTeX RDF
23	Qian-Ping Gu, Shietung Peng	k-Pairwise Cluster Fault Tolerant Routing in Hypercubes.	ISAAC	1994	DBLP DOI BibTeX RDF
22	Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman	Finding disjoint paths with related path costs.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF
22	Frank K. Hwang, Wen-Dar Lin	A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks.	ICPP Workshops	2001	DBLP DOI BibTeX RDF
22	Nihar R. Mahapatra, Shantanu Dutt	Efficient Network-Flow Based Techniques for Dynamic Fault Reconfiguration in FPGAs.	FTCS	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.	ISAAC	2005	DBLP DOI BibTeX RDF
19	Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang	Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.	FOCS	2005	DBLP DOI BibTeX RDF
19	Joseph Cheriyan, Mohammad R. Salavatipour	Hardness and Approximation Results for Packing Steiner Trees.	ESA	2004	DBLP DOI BibTeX RDF
19	Andreas Jakoby, Maciej Liskiewicz	Paths Problems in Symmetric Logarithmic Space.	ICALP	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.	ICDCS Workshops	2009	DBLP DOI BibTeX RDF
18	Nicolas Beldiceanu, Pierre Flener, Xavier Lorca	Combining Tree Partitioning, Precedence, and Incomparability Constraints.	Constraints An Int. J.	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.	PIMRC	2008	DBLP DOI BibTeX RDF
18	Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang	Buy-at-Bulk Network Design with Protection.	FOCS	2007	DBLP DOI BibTeX RDF
18	Zhi Zhang, Guanzhong Dai, Dejun Mu	Bandwidth-Aware Multipath Routing Protocol for Mobile Ad Hoc Networks.	UIC	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.	LCN	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.	IEEE Trans. Parallel Distributed Syst.	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.	Evol. Syst.	2023	DBLP DOI BibTeX RDF
18	Guangyu Li, Lin Chen	Finding Node-disjoint Paths Resilient to Channel Failures in Multi-channel Wireless Networks.	VTC Fall	2023	DBLP DOI BibTeX RDF
18	Maria Samonaki, Cristian Bermudez Serna, Carmen Mas Machuca	Survivable Node-Disjoint Routing in Multi-Domain Networks.	ICC	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.	ICA3PP (3)	2023	DBLP DOI BibTeX RDF
18	Xiaohong Xue, Shurong Zhang	Minsum node-disjoint paths with time-varying delay functions.	Int. J. Parallel Emergent Distributed Syst.	2022	DBLP DOI BibTeX RDF
18	Ashutosh Sharma, Lokesh Tharani	Ant Colony Based Node Disjoint Local Repair in Multipath Routing in MANET Network.	Wirel. Pers. Commun.	2022	DBLP DOI BibTeX RDF
18	Mahsa MalekiTabar, Amir Masoud Rahmani	A delay-constrained node-disjoint multipath routing in software-defined vehicular networks.	Peer-to-Peer Netw. Appl.	2022	DBLP DOI BibTeX RDF
18	Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat	Almost Polynomial Hardness of Node-Disjoint Paths in Grids.	Theory Comput.	2021	DBLP BibTeX RDF