Search results for "node-disjoint paths"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Qian-Ping Gu, Shietung Peng	An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. (PDF / PS)	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
3	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
3	Yuanyuan Yang, Jianchao Wang	Routing Permutations on Baseline Networks with Node-Disjoint Paths.	IEEE Trans. Parallel Distrib. Syst.	2005	DBLP DOI BibTeX RDF	semipermutation, baseline network, link-disjoint paths, crosstalk-free, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths
3	Yuanyuan Yang, Jianchao Wang	Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects.	IEEE Trans. Parallel Distrib. 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
3	Yuanyuan Yang, Jianchao Wang	Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Networks. (PDF / PS)	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
2	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
2	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
2	Weidong Chen, Wenjun Xiao, Behrooz Parhami	An Efficient Construction of Node Disjoint Paths in OTIS Networks.	APPT	2007	DBLP DOI BibTeX RDF
2	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
2	Ruei-Yu Wu, J. G. Chang, Gen-Huey Chen	Node-disjoint paths in hierarchical hypercube networks.	IPDPS	2006	DBLP DOI BibTeX RDF
2	Yuanyuan Yang, Jianchao Wang	Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths.	ICPADS	2004	DBLP DOI BibTeX RDF
2	Khaled Day, Abdel Elah Al-Ayyoub	Reliable Communication in Faulty Star Networks. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF	Fault tolerance, routing, distributed algorithm, star graph, node-disjoint paths
2	Qian-Ping Gu, Shietung Peng	Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. (PDF / PS)	IPDPS	2000	DBLP DOI BibTeX RDF	multistage interconnection networks, Permutation routing, all-optical networks, node-disjoint paths, wavelength routing, BPC permutations
2	Khaled Day, Abdel Elah Al-Ayyoub	Minimal Fault Diameter for Highly Resilient Product Networks.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	fault tolerance, interconnection networks, node-disjoint paths, product networks, Fault diameter
2	Chi-Chang Chen, Jianer Chen	Nearly Optimal One-to-Many Parallel Routing in Star Networks.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	parallel routing, Interconnection network, shortest path, routing algorithm, node-disjoint paths, star network
2	Khaled Day, Abdel Elah Al-Ayyoub	Fault Diameter of k-ary n-cube Networks.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter
2	Kenji Ishida, Yoshiaki Kakuda, Tohru Kikuno	A routing protocol for finding two node-disjoint paths in computer networks.	ICNP	1995	DBLP DOI BibTeX RDF
2	Seshu Madhavapeddy, Ivan Hal Sudborough	A topological property of hypercubes: node disjoint paths.	SPDP	1990	DBLP DOI BibTeX RDF
2	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
1	Ahmad Khader Haboush, Mohammad Al Nabhan, Motassem Al-Tarazi, Mohammad Al-Rawajbeh	Load Balancing Using Multiple Node Disjoint Paths.	Computer and Information Science	2012	DBLP BibTeX RDF
1	Cheng-Nan Lai	Two conditions for reducing the maximal length of node-disjoint paths in hypercubes.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
1	Cheng-Nan Lai	Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications.	IEEE Trans. Parallel Distrib. Syst.	2012	DBLP DOI BibTeX RDF
1	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
1	Lanny Sitanayah, Kenneth N. Brown, Cormac J. Sreenan	Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks.	Wireless Days	2011	DBLP DOI BibTeX RDF
1	Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu	Edge- and Node-Disjoint Paths in P Systems	MeCBIC	2010	DBLP DOI BibTeX RDF
1	Yonghong Xiang, Iain A. Stewart	One-to-many node-disjoint paths in (n, k)-star graphs.	Discrete Applied Mathematics	2010	DBLP DOI BibTeX RDF
1	Zbigniew Tarapata, Stefan Wroclawski	Subgraphs Generating Algorithm for Obtaining Set of Node-Disjoint Paths in Terrain-Based Mesh Graphs.	MIG	2010	DBLP DOI BibTeX RDF
1	Yun Ge, Guojun Wang, Jie Wu	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
1	Ash Abbas	A hybrid protocol for identification of a maximal set of node disjoint paths in mobile Ad hoc networks.	Int. Arab J. Inf. Technol.	2009	DBLP BibTeX RDF
1	Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan	Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary.	ASIACCS	2009	DBLP DOI BibTeX RDF	mixed adversary, information theoretic security, error probability
1	Ali Asghar Khavasi, Nastooh Taheri Javan	Using zone-disjoint multi-path routing algorithm for video transmission over ad-hoc networks.	Int. Conf. Interaction Sciences	2009	DBLP DOI BibTeX RDF	video multi-path transmission, zone-disjoint paths, MANET, multi-path routing
1	Luciano Bononi, Marco Di Felice, Antonella Molinaro, Sara Pizzi	A cross-layer architecture for robust video streaming over multi-radio multi-channel wireless mesh networks.	MOBIWAC	2009	DBLP DOI BibTeX RDF	wireless mesh networks, video streaming, cross-layering, multi-channel, multi-radio
1	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
1	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
1	Weidong Chen, Wenjun Xiao, Behrooz Parhami	Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant.	IEEE Trans. Parallel Distrib. Syst.	2009	DBLP DOI BibTeX RDF
1	Honggang Wang, Dongming Peng, Wei Wang 0015, Hamid Sharif, Hsiao-Hwa Chen	Image transmissions with security enhancement based on region and path diversity in wireless sensor networks.	IEEE Transactions on Wireless Communications	2009	DBLP DOI BibTeX RDF
1	Deying Li, 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
1	Mehmet Hakan Karaata, Rachid Hadid	Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks.	SSS	2009	DBLP DOI BibTeX RDF
1	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
1	Sahel Alouneh, Abdeslam En-Nouaary, Anjali Agarwal	MPLS security: an approach for unicast and multicast environments.	Annales des Télécommunications	2009	DBLP DOI BibTeX RDF	Threshold secret sharing scheme, Security, Confidentiality, MPLS
1	Ash Mohammad Abbas	Analysis of a hybrid protocol for identification of a maximal set of node-disjoint paths in mobile Ad hoc networks.	ICON	2008	DBLP DOI BibTeX RDF
1	Weidong Chen, Wenjun Xiao	Constructing Node-Disjoint Paths in Biswapped Networks (BSNs).	GPC Workshops	2008	DBLP DOI BibTeX RDF
1	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
1	Madhu Kumar SD, 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
1	Wei Cheng, Kai Xing, Xiuzhen Cheng, 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
1	Yuan Lu, Guojun Wang, Weijia Jia, Sancheng Peng	Multipath-Based Segment-by-Segment Routing Protocol in MANETs.	ICYCS	2008	DBLP DOI BibTeX RDF
1	Ruen Chze Loh, Sieteng Soh, Mihai Lazarescu, Suresh Rai	A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network.	PRDC	2008	DBLP DOI BibTeX RDF
1	Venkat Raju Gandikota, Bheemajun Reddy Tamma, C. Siva Ram Murthy	Adaptive FEC-Based Packet Loss Resilience Scheme for Supporting Voice Communication over Ad hoc Wireless Networks.	IEEE Trans. Mob. Comput.	2008	DBLP DOI BibTeX RDF
1	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	2008	DBLP DOI BibTeX RDF	Unipath and Multipath Routing Protocols, Ad hoc Network, Wireless Network, Routing Protocols
1	Changwen Liu, Mark D. Yarvis, W. Steven Conner, Xingang Guo	Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks.	Computer Communications	2007	DBLP DOI BibTeX RDF
1	Keiichi Kaneko, Naoki Sawada	An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs.	IEICE Transactions	2007	DBLP DOI BibTeX RDF
1	Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, Gerard J. Chang	Node-disjoint paths in hierarchical hypercube networks.	Inf. Sci.	2007	DBLP DOI BibTeX RDF
1	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
1	Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang	Buy-at-Bulk Network Design with Protection.	FOCS	2007	DBLP DOI BibTeX RDF
1	Sahel Alouneh, Abdeslam En-Nouaary, Anjali Agarwal	Securing MPLS Networks with Multi-path Routing.	ITNG	2007	DBLP DOI BibTeX RDF
1	Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha	A Scheme for Probabilistically Reliable Multicast Routing in Wireless Mesh Networks.	LCN	2007	DBLP DOI BibTeX RDF
1	Nicolas Beldiceanu, Xavier Lorca	Necessary Condition for Path Partitioning Constraints.	CPAIOR	2007	DBLP DOI BibTeX RDF
1	Markus Chimani, Maria Kandyba, Petra Mutzel	A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.	ESA	2007	DBLP DOI BibTeX RDF
1	Nastooh Taheri Javan, Mehdi Dehghan	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
1	Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori	Node-Disjoint Paths Algorithm in a Transposition Graph.	IEICE Transactions	2006	DBLP DOI BibTeX RDF
1	Ash Mohammad Abbas	Route Failure Time of Node-Disjoint Paths in Mobile Ad hoc Networks.	ICIT	2006	DBLP DOI BibTeX RDF
1	Mahdi Kefayati, Hamid R. Rabiee, Seyed Ghassem Miremadi, Ahmad Khonsari	Misbehavior resilient multi-path data transmission in mobile ad-hoc networks.	SASN	2006	DBLP DOI BibTeX RDF	MANET security, misbehavior resiliance, multipath routing
1	Matthew Andrews, Lisa Zhang	Logarithmic hardness of the undirected edge-disjoint paths problem.	J. ACM	2006	DBLP DOI BibTeX RDF	Hardness of approximation, undirected graphs, edge-disjoint paths
1	Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha	Protecting Multicast Sessions in Wireless Mesh Networks.	LCN	2006	DBLP DOI BibTeX RDF
1	Srinivasan Ramasubramanian, Mithun Harkara, Marwan Krunz	Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing.	Networking	2006	DBLP DOI BibTeX RDF
1	Zhi Zhang, Guanzhong Dai, Dejun Mu	Bandwidth-Aware Multipath Routing Protocol for Mobile Ad Hoc Networks.	UIC	2006	DBLP DOI BibTeX RDF
1	Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman	Finding disjoint paths with related path costs.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF
1	Ke Qiu, Selim G. Akl	On Node-to-Node Disjoint Paths in the Star Interconnection Network.	IASTED PDCS	2005	DBLP BibTeX RDF
1	Matthew Andrews, Lisa Zhang	Hardness of the undirected edge-disjoint paths problem.	STOC	2005	DBLP DOI BibTeX RDF	hardness of approximation, undirected graphs, edge-disjoint paths
1	Joseph Cheriyan, Adrian Vetta	Approximation algorithms for network design with metric costs.	STOC	2005	DBLP DOI BibTeX RDF	metric costs, approximation algorithms, graph connectivity
1	Wajahat Mateen, Saqib Raza, Zartash Afzal Uzmi, Shahab Baqai	Adaptive Multi-path On-Demand Routing in Mobile Ad Hoc Networks.	ISORC	2005	DBLP DOI BibTeX RDF
1	Anand Srinivas, Eytan Modiano	Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks.	Wireless Networks	2005	DBLP DOI BibTeX RDF	distributed algorithmsa, energy efficiency, graph theory, wireless ad-hoc networks, multipath routing, disjoint paths
1	Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori	Node-disjoint Paths in a Transposition Graph.	PDPTA	2004	DBLP BibTeX RDF
1	Anand Srinivas, Eytan 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
1	Jie Wu	An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks.	Telecommunication Systems	2003	DBLP DOI BibTeX RDF	simulation, optimization, ad hoc wireless networks, multipath routing, dynamic source routing (DSR)
1	Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh	Node-disjoint paths and related problems on hierarchical cubic networks.	Networks	2002	DBLP DOI BibTeX RDF
1	Jie Wu	An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks.	HICSS	2002	DBLP DOI BibTeX RDF	simulation, optimization, Ad hoc wireless networks, multipath routing, dynamic source routing (DSR)
1	Dahai Xu, Chunming Qiao, Yizhi Xiong	An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II. (PDF / PS)	ICNP	2002	DBLP DOI BibTeX RDF
1	Toshinori Takabatake, Masato Kitakami, Hideo Ito	Fault-Tolerant Properties of Generalized Hierarchical Completely-Connected Networks.	PRDC	2002	DBLP DOI BibTeX RDF
1	Khaled Day, Abdel Elah Al-Ayyoub	Topological Properties of OTIS-Networks.	IEEE Trans. Parallel Distrib. Syst.	2002	DBLP DOI BibTeX RDF	OTIS, optoelectronic systems, interconnection networks, embedding, topological properties
1	Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi	Fast and Dependable Communication in Hyper-rings.	COCOON	2002	DBLP DOI BibTeX RDF	Hyper-ring, reliability, network, broadcasting, connectivity
1	Andreas Jakoby, Maciej Liskiewicz	Paths Problems in Symmetric Logarithmic Space.	ICALP	2002	DBLP DOI BibTeX RDF
1	Frank K. Hwang, Wen-Dar Lin	A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks.	ICPP Workshops	2001	DBLP DOI BibTeX RDF
1	Kui Wu, Janelle J. Harms	Performance Study of a Multipath Routing Method for Wireless Mobile Ad Hoc Network.	MASCOTS	2001	DBLP DOI BibTeX RDF
1	Jianer Chen, Eunseuk Oh	Strong Fault-Tolerance: Parallel Routing in Networks with Faults.	International Conference on Computational Science	2001	DBLP DOI BibTeX RDF
1	Hong-Hsu Yen, Frank Yeong-Sung Lin	Backbone Network Design with QoS Requirements.	ICN	2001	DBLP DOI BibTeX RDF
1	Eunseuk Oh, Jianer Chen	On Strong Menger-Connectivity of Star Graphs.	WG	2001	DBLP DOI BibTeX RDF
1	Samit Soni	Hop Constrained Network Design Problem with Partial Survivability.	Annals OR	2001	DBLP DOI BibTeX RDF
1	Ming-Yang Su, Hui-Ling Huang, Gen-Huey Chen, Dyi-Rong Duh	Node-disjoint paths in incomplete WK-recursive networks.	Parallel Computing	2000	DBLP DOI BibTeX RDF
1	Alok Aggarwal, Jon M. Kleinberg, David P. Williamson	Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
1	Hyosun Ko, Shahram Latifi, Pradip K. Srimani	Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	multicasting, Broadcasting, hypercubes, wormhole routing, hamming codes, perfect codes
1	Hui-Ling Huang, Gen-Huey Chen	Combinatorial Properties of Two-Level Hypernet Networks.	IEEE Trans. Parallel Distrib. Syst.	1999	DBLP DOI BibTeX RDF	Best container, hypernet network, container, graph-theoretic interconnection network, wide diameter, fault diameter
1	Qian-Ping Gu, Shietung Peng	Cluster Fault Tolerant Routing in Hypercubes. (PDF / PS)	ICPP	1998	DBLP DOI BibTeX RDF
1	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
1	Chi-Chang Chen, Jianer Chen	Nearly Optimal One-To-Many Parallel Routing in Star Networks. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF
1	Khaled Day, Abdel Elah Al-Ayyoub	The Cross Product of Interconnection Networks.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	parallel paths, routing, interconnection networks, Broadcasting, embedding, product networks
1	Kisong Yoon	An Algorithm to enerate Sets of Node-Disjoint Paths in N-Dimensional Hypercube Network.	PDPTA	1996	DBLP BibTeX RDF
1	Alok Aggarwal, Jon M. Kleinberg, David P. Williamson	Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout.	STOC	1996	DBLP DOI BibTeX RDF
1	Qian-Ping Gu, Shietung Peng	Algorithms for Node Disjoint Paths in Incomplete Star Networks.	ICPADS	1994	DBLP BibTeX RDF
1	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