Search results for "paths"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
58	John Hershberger 0001, Matthew Maxel, Subhash Suri	Finding the k shortest simple paths: A new algorithm and its implementation.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Loop-free paths, directed paths, path equivalence class, replacement paths
58	Angela Krstic, Kwang-Ting Cheng	Generation of high quality tests for functional sensitizable paths.	VTS	1995	DBLP DOI BibTeX RDF	high quality tests, functional sensitizable paths, long paths, untestable paths, faulty conditions, test derivation, logic testing, delays, timing, integrated circuit testing, combinational circuits, combinational circuits, automatic testing, delay testing, test vectors, timing information
54	Huawei Li 0001, Zhongcheng Li, Yinghua Min	Reduction of Number of Paths to be Tested in Delay Testing.	J. Electron. Test.	2000	DBLP DOI BibTeX RDF	linearly independent, analytical delay model, delay testing, path sensitization
50	Stavroula Siachalou, Leonidas Georgiadis	Precomputation of Constrained Widest Paths in Communication Networks.	NETWORKING	2004	DBLP DOI BibTeX RDF	Widest Paths, Bottleneck Paths, Graph Theory, QoS Routing, Precomputation
50	Pratik Dave, Unmil Karadkar, Richard Furuta, Luis Francisco-Revilla, Frank M. Shipman III, Suvendu Dash, Zubin Dalal	Browsing intricately interconnected paths.	Hypertext	2003	DBLP DOI BibTeX RDF	directed paths, navigation metaphors, path engine, path-centric browsing, Walden's paths
49	Ching-Wen Chen, Chung-Ping Chung	Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving.	J. Supercomput.	2005	DBLP DOI BibTeX RDF	gamma interconnection networks, rerouting hops, collision ratio, multistage interconnection networks, disjoint paths, dynamic rerouting
46	Zhongtang Cai, Vibhore Kumar, Karsten Schwan	IQ-Paths: Predictably High Performance Data Streams across Dynamic Network Overlays.	HPDC	2006	DBLP DOI BibTeX RDF	grid-FTP application, IQ-Paths, predictably high performance data stream, dynamic overlay network, middleware realization, online network monitoring, user-defined utility requirement, statistical analysis, scheduling algorithm, packet routing, data-intensive application, network bandwidth
46	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
46	Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	Shortest Anisotropic Paths on Terrains.	ICALP	1999	DBLP DOI BibTeX RDF	aniositropic paths, computational geometry, approximation, shortest path
44	Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding	An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths.	ICA3PP	2009	DBLP DOI BibTeX RDF	Forbidden paths, Shortest paths, Network flows, Labeling algorithm
44	Stavroula Siachalou, Leonidas Georgiadis	Algorithms for precomputing constrained widest paths and multicast trees.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	bottleneck paths, widest paths, widest trees, graph theory, QoS routing, multicast trees, precomputation
44	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
42	Shangming Zhu, Zhili Zhang, Xinhua Zhuang	Modified Widest Disjoint Paths Algorithm for Multipath Routing.	NPC	2007	DBLP DOI BibTeX RDF	Widest disjoint paths, candidate path, width of path set, multipath routing
42	Bing Yang 0001, S. Q. Zheng 0001	Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.	TAMC	2006	DBLP DOI BibTeX RDF	algorithm, routing, reliability, complexity, network, graph, shortest path, survival, disjoint paths
42	Wuping Xu, Puliu Yan, Delin Xia, Ming Wu	Load Balancing Based on Similarity Multi-paths Routing.	ISPA	2005	DBLP DOI BibTeX RDF	Traffic split, Load Balancing, Similarity, Multi-Paths Routing
42	Jon M. Kleinberg, Éva Tardos	Disjoint Paths in Densely Embedded Graphs.	FOCS	1995	DBLP DOI BibTeX RDF	densely embedded graphs, communication paths, nearly-Eulerian graphs, locally planar interconnection networks, constant-factor approximation algorithm, maximum disjoint paths, on-line setting, routing, computational geometry, heuristics, multiprocessor interconnection networks, trees (mathematics), high-speed networks, operations research, disjoint paths, two-dimensional mesh
41	Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman	Algorithms for fault-tolerant routing in circuit switched networks.	SPAA	2002	DBLP DOI BibTeX RDF	flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths
41	Surender Baswana, Ramesh Hariharan, Sandeep Sen	Maintaining all-pairs approximate shortest paths under deletion of edges.	SODA	2003	DBLP BibTeX RDF
40	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
40	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
40	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
40	Ben Kao, Hector Garcia-Molina, Daniel Barbará	Aggressive Transmissions of Short Messages Over Redundant Paths.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	shortmessages, replicated transmissions, fault tolerant computing, message passing, redundancy, packet switching, response time, deadlines, real time communications, packets, fault-tolerant computer systems, redundant paths, multiple paths
40	Sriraman Tallam, Xiangyu Zhang 0001, Rajiv Gupta 0001	Extending Path Profiling across Loop Backedges and Procedure Boundaries.	CGO	2004	DBLP DOI BibTeX RDF	overlapping path profiles, profile guided optimization and instruction scheduling, path profiles
40	How-Rern Lin, TingTing Hwang	On determining sensitization criterion in an iterative gate sizing process.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
40	J. Paul Myers Jr.	Adaptive approaches to structural software testing (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
39	Sun-Yuan Hsieh, Yu-Fen Weng	Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Pairwise independent Hamiltonian paths, Hypercubes, Hamiltonian, Graph-theoretic interconnection networks, Fault-tolerant embedding
39	Naoki Sawada, Keiichi Kaneko, Shietung Peng	Pairwise Disjoint Paths in Pancake Graphs.	PDCAT	2007	DBLP DOI BibTeX RDF	interconnection networks, polynomial time algorithm, disjoint paths
39	Laurent D. Cohen, Thomas Deschamps	Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths.	EMMCVPR	2001	DBLP DOI BibTeX RDF	salient curve detection, weighted distance, medical imaging, reconstruction, level sets, active contours, energy minimization, Perceptual grouping, minimal paths, fast marching
39	Richard Furuta, Frank M. Shipman III, Catherine C. Marshall, Donald Brenner, Hao-wei Hsieh	Hypertext Paths and the World-Wide Web: Experiences with Walden's Paths.	Hypertext	1997	DBLP DOI BibTeX RDF	hypertext tours and paths, World Wide Web (WWW), educational applications, meta-structure, Walden's Paths
38	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
38	Wei-Cheng Lai, Angela Krstic, Kwang-Ting Cheng	On Testing the Path Delay Faults of a Microprocessor Using its Instruction Set.	VTS	2000	DBLP DOI BibTeX RDF	Microprocessor self-testing, Path delay fault classification, Functionally testable paths, Functional tests, Delay fault testing
38	Therese C. Biedl, Michal Stern	Edge-Intersection Graphs of k-Bend Paths in Grids.	COCOON	2009	DBLP DOI BibTeX RDF
38	Peng Zhang 0008, Wenbo Zhao 0001	On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.	ESCAPE	2007	DBLP DOI BibTeX RDF
37	Anne Vialard	Geometrical parameters extraction from discrete paths.	DGCI	1996	DBLP DOI BibTeX RDF	Discrete Paths, Euclidean Paths, lenght estimation, curvature estimation
36	Vivekananda M. Vedula, Jacob A. Abraham	FACTOR: A Hierarchical Methodology for Functional Test Generation and Testability Analysis.	DATE	2002	DBLP DOI BibTeX RDF
36	Lei Shi, Vandana Pursnani Janeja	Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP).	KDD	2009	DBLP DOI BibTeX RDF	anomalous window discovery, intersecting paths, scan statistic, traffic accidents
36	Petr A. Golovach, Dimitrios M. Thilikos	Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF	Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms
36	Patricia Mouy, Bruno Marre, Nicky Williams, Pascale Le Gall	Generation of All-Paths Unit Test with Function Calls.	ICST	2008	DBLP DOI BibTeX RDF	all-paths unit test, unit test with function calls, unit test, constraint solving, structural testing, automatic generation, testing C programs
36	Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi	Preferential path profiling: compactly numbering interesting paths.	POPL	2007	DBLP DOI BibTeX RDF	preferential paths, profiling, dynamic analysis, arithmetic coding
36	Minh Ngoc Ngo, Hee Beng Kuan Tan	Detecting large number of infeasible paths through recognizing their patterns.	ESEC/SIGSOFT FSE	2007	DBLP DOI BibTeX RDF	empirical properties, static analysis, structural testing, coverage analysis, infeasible paths
36	Sun-Yuan Hsieh	Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	pairwise independent Hamiltonian paths, Interconnection networks, hypercubes, Hamiltonian, fault-tolerant embedding
36	Bing Yang 0001, Mei Yang, Jianping Wang 0001, S. Q. Zheng 0001	Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications.	ISPAN	2005	DBLP DOI BibTeX RDF	algorithm, reliability, complexity, Networks, graph, shortest path, survivability, network flow, protection, disjoint paths, minimum cost network flow
34	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
34	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
34	Yuval Emek, David Peleg, Liam Roditty	A near-linear time algorithm for computing replacement paths in planar directed graphs.	SODA	2008	DBLP BibTeX RDF
34	Zhongtang Cai, Vibhore Kumar, Karsten Schwan	IQ-Paths: Predictably High Performance Data Streams Across Dynamic Network Overlays.	J. Grid Comput.	2007	DBLP DOI BibTeX RDF	Statistical prediction, Grid, Overlay network, High performance, Self-management, Available bandwidth, Data-intensive applications, Self-regulating
34	I-De Huang, Sandeep K. Gupta 0001	Selection of Paths for Delay Testing.	Asian Test Symposium	2005	DBLP DOI BibTeX RDF
34	Yun Shao 0002, Sudhakar M. Reddy, Irith Pomeranz, Seiji Kajihara	On Selecting Testable Paths in Scan Designs.	J. Electron. Test.	2003	DBLP DOI BibTeX RDF	testable path, delay testing, delay fault, path delay fault, path selection
34	Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong	The stable paths problem and interdomain routing.	IEEE/ACM Trans. Netw.	2002	DBLP DOI BibTeX RDF	path vector protocols, stable routing, BGP, Border Gateway Protocol, interdomain routing, internet routing
34	Srihari Nelakuditi, Zhi-Li Zhang	On Selection of Paths for Multipath Routing.	IWQoS	2001	DBLP DOI BibTeX RDF
34	Unmil Karadkar, Luis Francisco-Revilla, Richard Furuta, Frank M. Shipman III	Structuring Access to a Dynamic Collection of Digital Documents: The Walden's Paths Vitual Directories.	DDEP/PODDP	2000	DBLP DOI BibTeX RDF
34	Seiji Kajihara, Kozo Kinoshita, Irith Pomeranz, Sudhakar M. Reddy	A Method for Identifying Robust Dependent and Functionally Unsensitizable Paths.	VLSI Design	1997	DBLP DOI BibTeX RDF	robust dependent path, local circuit analysis, logic circuit testing, functionally unsensitizable path, timing, logic circuits
33	Irith Pomeranz, Sudhakar M. Reddy	Test enrichment for path delay faults using multiple sets of target faults.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
33	João L. Sobrinho	Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet.	IEEE/ACM Trans. Netw.	2002	DBLP DOI BibTeX RDF	quality of service, internet, Internet, routing, algebra
33	Michael K. Reiter, Stuart G. Stubblebine	Toward Acceptable Metrics of Authentication.	S&P	1997	DBLP DOI BibTeX RDF	authentication metrics design, trusted intermediaries, intersecting paths, key interdependencies, certificates, ambiguities, message authentication, large-scale system, confidence, acceptability, multiple paths
32	Jason J. Holdsworth, Siu Man Lui	GPS-enabled mobiles for learning shortest paths: a pilot study.	FDG	2009	DBLP DOI BibTeX RDF	GPS-enabled mobile phones, mobile learning, problem-based learning, shortest paths algorithm
32	David Avis, Bohdan Kaluzny	Computing monotone disjoint paths on polytopes.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy
32	Sungwoo Tak, E. K. Park	Restoration performance study of k-shortest disjoint paths in WDM optical networks.	Telecommun. Syst.	2007	DBLP DOI BibTeX RDF	Shortest disjoint paths, Dynamic programming principle, Optimization, Restoration, WDM optical networks
32	Michael Elkin	Computing almost shortest paths.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	almost shortest paths, Graph algorithms, spanners
32	Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack	Determining approximate shortest paths on weighted polyhedral surfaces.	J. ACM	2005	DBLP DOI BibTeX RDF	weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces
32	Changming Sun, Ben Appleton	Multiple Paths Extraction in Images Using a Constrained Expanded Trellis.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF	Multiple paths extraction, constrained expanded trellis, feature extraction, object segmentation
32	Damien Joseph, Soon Ang, Sandra Slaughter	Identifying the prototypical career paths of IT professionals: a sequence and cluster analysis.	CPR	2005	DBLP DOI BibTeX RDF	sequence analysis, longitudinal, IT profession, career paths
32	Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink	Testing Homotopy for Paths in the Plane.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF	Simple paths, Computational topology, Homotopy
32	Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees.	Algorithmica	2000	DBLP DOI BibTeX RDF	Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth
32	Eugene Goldberg, Alexander Saldanha	Timing Analysis with Implicitly Specified False Paths.	VLSI Design	2000	DBLP DOI BibTeX RDF	known false paths, implicit false path representation, timing analysis, breadth-first search
32	Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).	ISAAC	1996	DBLP DOI BibTeX RDF	bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree
31	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
31	Deepayan Chakrabarti, Rupesh R. Mehta	The paths more taken: matching DOM trees to search logs for accurate webpage clustering.	WWW	2010	DBLP DOI BibTeX RDF	clustering, wrapper induction, search logs
31	Yoshinori Kitatsuji, Masato Tsuru, Tetsuya Takine, Yuji Oie	Flow assignment method with traffic characteristics over multiple paths for reducing queuing delay.	Telecommun. Syst.	2008	DBLP DOI BibTeX RDF	Flow assignment, Traffic engineering, Queuing delay, Traffic characteristics
31	Antoine B. Bagula, Anthony E. Krzesinski	Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model.	MASCOTS	2001	DBLP DOI BibTeX RDF
31	R. Iris Bahar, Hyunwoo Cho, Gary D. Hachtel, Enrico Macii, Fabio Somenzi	Symbolic timing analysis and resynthesis for low power of combinational circuits containing false paths.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
31	How-Rern Lin, TingTing Hwang	Dynamical identification of critical paths for iterative gate sizing.	ICCAD	1994	DBLP DOI BibTeX RDF
31	Edith Cohen	Fast algorithms for constructing t-spanners and paths with stretch t	FOCS	1993	DBLP DOI BibTeX RDF	pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph
31	John Hershberger 0001, Subhash Suri	Efficient Computation of Euclidean Shortest Paths in the Plane	FOCS	1993	DBLP DOI BibTeX RDF	plane computational geometry, polygonal obstacles, shortest paths, time complexity, Euclidean shortest paths, efficient computation, worst-case time
31	David R. Karger, Daphne Koller, Steven J. Phillips	Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths	FOCS	1991	DBLP DOI BibTeX RDF	path-comparison-based algorithm, hidden paths algorithm, edge weights, lower bound, time bounds, weighted graphs, all-pairs shortest paths
31	Samir Khuller, Baruch Schieber	Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)	FOCS	1989	DBLP DOI BibTeX RDF	k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM
31	Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani	Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph	FOCS	1989	DBLP DOI BibTeX RDF	disjoint paths problem, Kuratowski homeomorph, vertex-disjoint paths, NC planarity algorithms, processor-time product, routing, parallel algorithms, sequential algorithm, planar embedding, polylogarithmic factor
30	Shun-Yen Lu, Pei-Ying Hsieh, Jing-Jia Liou	Exploring linear structures of critical path delay faults to reduce test efforts.	ICCAD	2006	DBLP DOI BibTeX RDF
30	Marwan A. Gharaybeh, Vishwani D. Agrawal, Michael L. Bushnell, Carlos G. Parodi	False-Path Removal Using Delay Fault Simulation.	J. Electron. Test.	2000	DBLP DOI BibTeX RDF	design for testability, fault simulation, Delay testing, path delay faults, synthesis for testability, redundancy removal
30	Shmuel Zaks	On the Use of Duality and Geometry in Layouts for ATM Networks.	MFCS	2000	DBLP DOI BibTeX RDF
30	Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen	Cycle time and slack optimization for VLSI-chips.	ICCAD	1999	DBLP DOI BibTeX RDF
30	Huawei Li 0001, Zhongcheng Li, Yinghua Min	Delay Testing with Double Observations.	Asian Test Symposium	1998	DBLP DOI BibTeX RDF	linearly independent, test generation, observation, delay testing
30	L. Howard Holley, Barry K. Rosen	Qualified Data Flow Problems.	POPL	1980	DBLP DOI BibTeX RDF
29	I-De Huang, Yi-Shing Chang, Sandeep K. Gupta 0001, Sreejit Chakravarty	An Industrial Case Study of Sticky Path-Delay Faults.	VTS	2008	DBLP DOI BibTeX RDF	sticky paths, timing false paths, path reprioritization, delay testing, test quality
29	Sung-Woo Chang, Hyoung-Joo Kim	SOPView+: an object browser which supports navigating database by changing base object.	COMPSAC	1997	DBLP DOI BibTeX RDF	SOPView+, object browser, large database navigation, base object, forward navigation, reference paths, backward navigation, reference hierarchy, screen real estate problem, extended synchronized browsing, online front-ends, navigational paths
29	Tse-Yun Feng, Yanggon Kim	Fault-diagnosis for a class of distributed control multistage interconnection networks.	FTDCS	1995	DBLP DOI BibTeX RDF	distributed control multistage interconnection networks, multiple disjoint paths, input/output terminals, fault-diagnosis method, self-routing tags, fault-location procedure, performance evaluation, fault-tolerance, fault-diagnosis, fault tolerant computing, multistage interconnection networks, fault location, redundant paths
29	Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer	Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.	WINE	2008	DBLP DOI BibTeX RDF	Network Pricing Games, Communication Networks, Stackelberg Games, Shortest Paths Tree
29	Himanshu Gupta, Rephael Wenger	Constructing pairwise disjoint paths with few links.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Link paths, isomorphic triangulations, noncrossing, polygon
29	Zareen Alamgir, Sarmad Abbasi	Combinatorial Algorithms for Listing Paths in Minimal Change Order.	CAAN	2007	DBLP DOI BibTeX RDF	Minimal change order, Revolving door order, Generation of paths, Combinatorial algorithms, Complete graph
29	Emerson Ribeiro de Mello, Aad P. A. van Moorsel, Joni da Silva Fraga	Evaluation of P2P Search Algorithms for Discovering Trust Paths.	EPEW	2007	DBLP DOI BibTeX RDF	Peer-to-Peer, Web of Trust, Trust Paths
29	Qing Xu 0002, Mateu Sbert	A New Way to Re-using Paths.	ICCSA (2)	2007	DBLP DOI BibTeX RDF	Reusing paths, Ray tracing, Global Illumination, Monte Carlo
29	Roberto Ardon, Laurent D. Cohen	Fast Constrained Surface Extraction by Minimal Paths.	Int. J. Comput. Vis.	2006	DBLP DOI BibTeX RDF	active contours, level set method, object extraction, minimal paths, active surfaces
29	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Edge-disjoint paths in Planar graphs with constant congestion.	STOC	2006	DBLP DOI BibTeX RDF	Planar graphs, multicommodity flow, edge-disjoint paths
29	Hiroyuki Iwata, Tomokazu Yoneda, Satoshi Ohtake, Hideo Fujiwara	A DFT Method for RTL Data Paths Based on Partially Strong Testability to Guarantee Complete Fault Efficiency.	Asian Test Symposium	2005	DBLP DOI BibTeX RDF	strong testability, partially strong testability, complete fault efficiency, design-for-testability, data paths
29	Roberto Ardon, Laurent D. Cohen, Anthony J. Yezzi	A New Implicit Method for Surface Segmentation by Minimal Paths: Applications in 3D Medical Images.	EMMCVPR	2005	DBLP DOI BibTeX RDF	Stationary Transport Equation, Image segmentation, Active contours, Level Set method, Object Extraction, Minimal Paths
29	Keiichi Kaneko	Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs.	ISPA	2004	DBLP DOI BibTeX RDF	node-to-set disjoint paths problem, bi-rotator graphs, fault tolerance, parallel computation
29	Toshinori Hosokawa, Hiroshi Date, Masahide Miyazaki, Michiaki Muraoka, Hideo Fujiwara	A Method of Test Plan Grouping to Shorten Test Length for RTL Data Paths under a Test Controller Area Constraint.	Asian Test Symposium	2003	DBLP DOI BibTeX RDF	test plan grouping, test controllers, partly compacted test plan tables, RTL data paths, test length
29	Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh	Constructing One-to-Many Disjoint Paths in Folded Hypercubes.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	folded hypercube, Rabin number, hypercube, optimization problem, Disjoint paths
29	Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink	Testing Homotopy for paths in the plane.	SCG	2002	DBLP DOI BibTeX RDF	simple paths, computational topology, Homotopy
29	Thomas Deschamps, Laurent D. Cohen	Minimal Paths in 3D Images and Application to Virtual Endoscopy.	ECCV (2)	2000	DBLP DOI BibTeX RDF	Medical image understanding, Deformable Models, Level Set methods, Minimal paths, Fast Marching, Eikonal Equation