Search results for "paths"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Brice Augustin, Timur Friedman, Renata Teixeira	Measuring load-balanced paths in the internet.	Internet Measurement Conference	2007	DBLP DOI BibTeX RDF	load balancing, multipath, path diversity, traceroute
21	Srecko Brlek, Elisa Pergola, Olivier Roques	Non uniform random generation of generalized Motzkin paths.	Acta Informatica	2006	DBLP DOI BibTeX RDF	Generalized Motzkin path, Random generation, Rejection
21	Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour	Packing Non-Zero A-Paths In Group-Labelled Graphs.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C22
21	Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman	Finding disjoint paths with related path costs.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF
21	Hyesoon Kim, José A. Joao, Onur Mutlu, Yale N. Patt	Diverge-Merge Processor (DMP): Dynamic Predicated Execution of Complex Control-Flow Graphs Based on Frequently Executed Paths.	MICRO	2006	DBLP DOI BibTeX RDF
21	Andrea De Mauro, Dan Schonfeld, Claudio Casetti	A Peer-to-Peer Overlay Network for Real Time Video Communication using Multiple Paths.	ICME	2006	DBLP DOI BibTeX RDF
21	Yanzhi Li, Andrew Lim 0001, Hong Ma	A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem.	IEA/AIE	2006	DBLP DOI BibTeX RDF	length-balanced, shortest path, Lagrangian relaxation
21	Anxiao Jiang, Jehoshua Bruck	Multicluster interleaving on paths and cycles.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
21	Torsten Tholey	Finding Disjoint Paths on Directed Acyclic Graphs.	WG	2005	DBLP DOI BibTeX RDF
21	Egon Wanke, Rolf Kötter	Oriented Paths in Mixed Graphs.	ISAAC	2004	DBLP DOI BibTeX RDF
21	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Edge-Disjoint Paths in Planar Graphs.	FOCS	2004	DBLP DOI BibTeX RDF
21	Tamer Nadeem, Suman Banerjee 0001, Archan Misra, Ashok K. Agrawala	Energy-Efficient Reliable Paths for On-Demand Routing Protocols.	MWCN	2004	DBLP DOI BibTeX RDF
21	Jianhui Xing, Hong Wang, Shiyuan Yang	Constructing Transparency Paths for IP Cores Using Greedy Searching Strategy.	Asian Test Symposium	2004	DBLP DOI BibTeX RDF
21	Klaus Weinert, Marc Stautner	Generating Multiaxis Tool Paths for Die and Mold Making with Evolutionary Algorithms.	GECCO (2)	2004	DBLP DOI BibTeX RDF
21	Nicolas Markey, Jean-François Raskin	Model Checking Restricted Sets of Timed Paths.	CONCUR	2004	DBLP DOI BibTeX RDF
21	Eric Saund	Finding Perceptually Closed Paths in Sketches and Drawings.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	Contour closure, closed path, Gestalt laws, sketch interpretation, line art analysis, graphics recognition, perceptual organization
21	Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos	Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.	WAOA	2003	DBLP DOI BibTeX RDF
21	Michael Gerharz, Christian de Waal, Peter Martini, Paul James	Strategies for Finding Stable Paths in Mobile Wireless Ad Hoc Networks.	LCN	2003	DBLP DOI BibTeX RDF
21	Budhaditya Deb, Sudeept Bhatnagar, Badri Nath	ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks.	LCN	2003	DBLP DOI BibTeX RDF
21	Weifa Liang, Xiaojun Shen 0002	Finding Multiple Routing Paths in Wide-Area WDM Networks.	ICPP Workshops	2002	DBLP DOI BibTeX RDF
21	Shunan Lin, Yao Wang 0001, Shiwen Mao, Shivendra S. Panwar	Video transport over ad-hoc networks using multiple paths.	ISCAS (1)	2002	DBLP DOI BibTeX RDF
21	Dimiter R. Avresky, Vladimir Shurbanov, Natcho H. Natchev, F. Zuccarino, Pankaj Mehra	Optimal Utilization of Equivalent Paths in Computer Networks with Static Routing.	NCA	2001	DBLP DOI BibTeX RDF
21	Shunan Lin, Shiwen Mao, Yao Wang 0001, Shivendra S. Panwar	A Reference Picture Selection Scheme For Video Transmission Over Ad-Hoc Networks Using Multiple Paths.	ICME	2001	DBLP DOI BibTeX RDF
21	Michael Elkin	Computing almost shortest paths.	PODC	2001	DBLP DOI BibTeX RDF
21	Valerie King	Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs.	FOCS	1999	DBLP DOI BibTeX RDF
21	Sébastien Fourey, Rémy Malgouyres	Intersection Number of Paths Lying on a Digital Surface and a New Jordan Theorem.	DGCI	1999	DBLP DOI BibTeX RDF	surfels curves, Digital topology, digital surfaces
21	Philip N. Klein, Sairam Subramanian	A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs.	Algorithmica	1998	DBLP DOI BibTeX RDF	Minimum-cost path, Minimum-cost path, Shortest path, Shortest path, Graph algorithm, Graph algorithm, Planar graph, Planar graph, Key words, Dynamic algorithm, Dynamic algorithm
21	Eric Ruppert	Finding the k Shortest Paths in Parallel.	STACS	1997	DBLP DOI BibTeX RDF	Topics parallel algorithms, data structures
21	David Hartvigsen	Generalized Max Flows and Augmenting Paths.	IPCO	1995	DBLP DOI BibTeX RDF
21	Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe	Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.	ISAAC	1993	DBLP DOI BibTeX RDF
21	Arch D. Robison	A group of permutations with edge-disjoint paths on hypercubes.	SPDP	1991	DBLP DOI BibTeX RDF
21	Jacques Benkoski, E. Vanden Meersch, Luc J. M. Claesen, Hugo De Man	Timing verification using statically sensitizable paths.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
21	Andreas Schwill	Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths.	STACS	1990	DBLP DOI BibTeX RDF
21	James M. Bieman, Janet L. Schultz	Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion.	Symposium on Testing, Analysis, and Verification	1989	DBLP DOI BibTeX RDF
21	Derek F. Yates, Nicos Malevris	Reducing the Effects of Infeasible Paths in Branch Testing.	Symposium on Testing, Analysis, and Verification	1989	DBLP DOI BibTeX RDF
20	Lin Xie, Azadeh Davoodi	Representative path selection for post-silicon timing prediction under variability.	DAC	2010	DBLP DOI BibTeX RDF	process variations, post-silicon validation
20	Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le Roux	Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation.	Networking	2009	DBLP DOI BibTeX RDF	local protection, backup path computation, network, MPLS, survivability, resource optimization, Shared Risk Link Group (SRLG)
20	Maren Martens	A Simple Greedy Algorithm for the k-Disjoint Flow Problem.	TAMC	2009	DBLP DOI BibTeX RDF
20	Kunal Taneja, Tao Xie 0001, Nikolai Tillmann, Jonathan de Halleux, Wolfram Schulte	Guided path exploration for regression test generation.	ICSE Companion	2009	DBLP DOI BibTeX RDF
20	Nicholas Callegari, Li-C. Wang, Pouria Bastani	Speedpath analysis based on hypothesis pruning and ranking.	DAC	2009	DBLP DOI BibTeX RDF	speedpath, data mining, timing analysis
20	Stephan Bohacek	Performance Improvements Provided by Route Diversity in Multihop Wireless Networks.	IEEE Trans. Mob. Comput.	2008	DBLP DOI BibTeX RDF	Wireless communication, Routing protocols, Network communications
20	Michael S. Branicky, Ross A. Knepper, James J. Kuffner	Path and trajectory diversity: Theory and algorithms.	ICRA	2008	DBLP DOI BibTeX RDF
20	Ioan Alexandru Sucan, Jonathan F. Kruse, Mark Yim, Lydia E. Kavraki	Kinodynamic motion planning with hardware demonstrations.	IROS	2008	DBLP DOI BibTeX RDF
20	Shaoyin Cheng, Fan Jiang 0005, Jiajie Wang, Tao Zhang, Xuezhi Xing	DBTG: Demand-Driven Backtracking Test Generation.	ICYCS	2008	DBLP DOI BibTeX RDF
20	Murali Krishna Ramanathan, Koushik Sen, Ananth Grama, Suresh Jagannathan	Protocol Inference Using Static Path Profiles.	SAS	2008	DBLP DOI BibTeX RDF
20	Somitra Kumar Sanadhya, Palash Sarkar 0001	Non-linear Reduced Round Attacks against SHA-2 Hash Family.	ACISP	2008	DBLP DOI BibTeX RDF
20	Juan Jose Galvez, Pedro M. Ruiz, Antonio Fernandez Gómez-Skarmeta	Spatially Disjoint Multipath Routing protocol without location information.	LCN	2008	DBLP DOI BibTeX RDF
20	Yigal Bejerano, Seung-Jae Han, Keon-Taek Lee, Amit Kumar 0001	Single-path routing for life time maximization in multi-hop wireless networks.	LCN	2008	DBLP DOI BibTeX RDF
20	Vincent Borrel, Mostafa H. Ammar, Ellen W. Zegura	Understanding the wireless and mobile network space: a routing-centered classification.	Challenged Networks	2007	DBLP DOI BibTeX RDF	classification, routing, DTN
20	Pascal Mérindol, Jean-Jacques Pansiot, Stéphane Cateloin	Path Computation for Incoming Interface Multipath Routing.	ECUMN	2007	DBLP DOI BibTeX RDF
20	Viet Q. Phung, Daryoush Habibi, Hoang Nam Nguyen	On Diverse Routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks.	ICON	2007	DBLP DOI BibTeX RDF
20	Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong 0001, Michael Kaufmann 0001, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis	Colored Simultaneous Geometric Embeddings.	COCOON	2007	DBLP DOI BibTeX RDF
20	Wankang Zhao, William C. Kreahling, David B. Whalley, Christopher A. Healy, Frank Mueller 0001	Improving WCET by applying worst-case path optimizations.	Real Time Syst.	2006	DBLP DOI BibTeX RDF	Path-based optimizations, Embedded systems, WCET
20	Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic	Robustness of the Internet at the Topology and Routing Level.	Research Results of the DICS Program	2006	DBLP DOI BibTeX RDF
20	Stephen Mueller, Dipak Ghosal	Analysis of a Distributed Algorithm to Determine Multiple Routes with Path Diversity in Ad Hoc Networks.	WiOpt	2005	DBLP DOI BibTeX RDF
20	Najah A. Abu Ali, Hussein T. Mouftah, Saeed Gazor	Multi-Path Traffic Engineering Distributed VPLS Routing Algorithm.	Systems Communications	2005	DBLP DOI BibTeX RDF
20	Qiang Li 0008, Qinyuan Feng, Liang Hu 0001, Jiubin Ju	Fast Two Phrases PPM for IP Traceback.	PDCAT	2005	DBLP DOI BibTeX RDF
20	Constantino M. Lagoa, Hao Che, Bernardo A. Movsichoff	Adaptive control algorithms for decentralized optimal traffic engineering in the internet.	IEEE/ACM Trans. Netw.	2004	DBLP DOI BibTeX RDF	optimization, traffic engineering, sliding mode control
20	Xiang Lu, Zhuo Li 0001, Wangqi Qiu, D. M. H. Walker, Weiping Shi	Longest path selection for delay test under process variation.	ASP-DAC	2004	DBLP DOI BibTeX RDF
20	Irith Pomeranz, Sudhakar M. Reddy	A Postprocessing Procedure of Test Enrichment for Path Delay Faults.	Asian Test Symposium	2004	DBLP DOI BibTeX RDF
20	Puneet Gupta, Michael S. Hsiao	High Quality ATPG for Delay Defects.	ITC	2003	DBLP DOI BibTeX RDF
20	Panagiotis Papadimitratos, Zygmunt J. Haas, Emin Gün Sirer	Path set selection in mobile ad hoc networks.	MobiHoc	2002	DBLP DOI BibTeX RDF	path set selection, reliability, mobile ad hoc networks
20	Kitt Tientanopajai, Kanchana Kanchanasut	Multiconstraint QoS Routing Using a Path-Vector Protocol.	ASIAN	2002	DBLP DOI BibTeX RDF
20	Thomas Erlebach	Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings.	MFCS	2001	DBLP DOI BibTeX RDF
20	Angela Krstic, Kwang-Ting Cheng, Srimat T. Chakradhar	Primitive delay faults: identification, testing, and design for testability.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
20	Yuji Kukimoto, Robert K. Brayton	Timing-safe false path removal for combinational modules.	ICCAD	1999	DBLP DOI BibTeX RDF
20	Angela Krstic, Kwang-Ting Cheng	Resynthesis of Combinational Circuits for Path Count Reduction and for Path Delay Fault Testability.	J. Electron. Test.	1997	DBLP DOI BibTeX RDF	resynthesis for testability, timing defects, delay testing, path delay faults, VLSI testing
20	Spyros Tragoudas, Yaakov L. Varol	Computing Disjoint Path with Lenght Constraints.	WG	1996	DBLP DOI BibTeX RDF
20	Haruo Takeda, Claudio Facchinetti, Jean-Claude Latombe	Planning the Motions of a Mobile Robot in a Sensory Uncertainty Field.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	laser ranging, sensory uncertainty field, robot configuration, localization function, classical line-striping camera/laser range sensor, motion planner, navigation, mobile robots, mobile robot, path planning, computerised navigation, environment model, path length
19	Jérôme Berclaz, François Fleuret, Engin Türetken, Pascal Fua	Multiple Object Tracking Using K-Shortest Paths Optimization.	IEEE Trans. Pattern Anal. Mach. Intell.	2011	DBLP DOI BibTeX RDF	multiobject tracking, linear programming, Data association, K-shortest paths
19	Guanfeng Liu 0001, Yan Wang 0002, Mehmet A. Orgun	Finding K Optimal Social Trust Paths for the Selection of Trustworthy Service Providers in Complex Social Networks.	ICWS	2011	DBLP DOI BibTeX RDF	K paths selection, service provider selection, social networks, trust
19	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
19	Thomas Bochot, Pierre Virelizier, Hélène Waeselynck, Virginie Wiels	Paths to Property Violation: A Structural Approach for Analyzing Counter-Examples.	HASE	2010	DBLP DOI BibTeX RDF	Analysis of counterexamples, SCADE models, structural paths
19	Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu	Maximizing Bandwidth Using Disjoint Paths.	AINA	2010	DBLP DOI BibTeX RDF	maximum bandwidth, path bandwidth, edge-disjoint paths, network bandwidth, network QoS
19	Aaron Bernstein	Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time.	FOCS	2009	DBLP DOI BibTeX RDF	approximation algorithms, shortest paths, graph algorithms, dynamic algorithms
19	Ruen Chze Loh, Sieteng Soh, Mihai M. Lazarescu	An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints.	AINA	2009	DBLP DOI BibTeX RDF	multi-constrained edge disjoint paths, approximate algorithm, network reliability, network delay, Lagrange relaxation
19	Tobias Friedrich 0001, Nils Hebbinghaus	Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.	ISAAC	2008	DBLP DOI BibTeX RDF	shortest paths, random graphs, average-case analysis, Dynamic graph algorithms
19	Yann Disser, Matthias Müller-Hannemann, Mathias Schnee	Multi-criteria Shortest Paths in Time-Dependent Train Networks.	WEA	2008	DBLP DOI BibTeX RDF	time-dependent graphs, case study, shortest paths, multi-criteria optimization, speed-up techniques
19	Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi	The location of median paths on grid graphs.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Median paths, Facility location, Grid graphs
19	Valentin Polishchuk, Joseph S. B. Mitchell	Thick non-crossing paths and minimum-cost flows in polygonal domains.	SCG	2007	DBLP DOI BibTeX RDF	geometric shortest paths, data structures, minimum-cost flows
19	Zhendong Wu, Shanping Li	An Adaptive Multi-paths Algorithm for Wireless Sensor Networks.	ICESS	2007	DBLP DOI BibTeX RDF	Adaptive Multi-paths, Local Minimum Phenomenon, Right hand rule, Sensor Networks
19	Gyula Pap	Some new results on node-capacitated packing of A-paths.	STOC	2007	DBLP DOI BibTeX RDF	node-capacities, paths-packing, algorithms
19	Mikkel Thorup	Worst-case update times for fully-dynamic all-pairs shortest paths.	STOC	2005	DBLP DOI BibTeX RDF	worst-case update times, shortest paths, dynamic graph algorithms
19	Eric Klassen, Anuj Srivastava, Washington Mio, Shantanu H. Joshi	Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	geodesic paths, shape statistics, intrinsic mean shapes, shape-based clustering, shape interpolation, Shape metrics
19	Pierre Fransson, Lenka Carr-Motycková	Brief announcement: an incremental algorithm for calculation of backup-paths in link-state networks.	PODC	2004	DBLP DOI BibTeX RDF	backup-paths, link-state networks, routing
19	Rezaul Alam Chowdhury, Vijaya Ramachandran	Cache-oblivious shortest paths in graphs using buffer heap.	SPAA	2004	DBLP DOI BibTeX RDF	buffer heap, cache-aware model, cache-oblivious model, decrease-key, tournament tree, shortest paths, priority queue
19	József Balogh, Oded Regev 0001, Clifford D. Smyth, William L. Steiger, Mario Szegedy	Long monotone paths in line arrangements.	SCG	2003	DBLP DOI BibTeX RDF	discrete line arrangements, monotone paths
19	Bin Xu 0009, Danny Z. Chen, Robert J. Szczerba	Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees.	Agents	2000	DBLP DOI BibTeX RDF	cell decomposition, framed-octrees, union-find structure, computational geometry, path planning, optimal paths
19	Shinji Inoue, Yoshiaki Kakuda	Multiple Backup Virtual Paths Reservation Problem and Its Solution.	ICECCS	2000	DBLP DOI BibTeX RDF	multiple backup virtual paths reservation problem, backup virtual path, primary VP, reliable computer network, multiple failures, pairwise backup VP, multiagent based method, computer network reliability
19	Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan	Approximating shortest paths on a convex polytope in three dimensions.	J. ACM	1997	DBLP DOI BibTeX RDF	approximation algorithms, convex polytopes, Euclidean shortest paths
19	Dorit Dor, Shay Halperin, Uri Zwick	All Pairs Almost Shortest Paths.	FOCS	1996	DBLP DOI BibTeX RDF	all pairs almost shortest paths, unweighted undirected graph, matrix multiplication algorithm, 3-spanner, weighted undirected graph, matrix multiplication, vertices, Boolean matrix multiplication
19	Jon M. Kleinberg, Ronitt Rubinfeld	Short Paths in Expander Graphs.	FOCS	1996	DBLP DOI BibTeX RDF	inter-connection networks, disjoint paths problem, graph minor containment, polylogarithmic approximation, routing algorithms, greedy algorithm, network routing, multicommodity flow, expander graphs
19	Hiroshi Takahashi, Nobuhiro Yanagida, Yuzo Takamatsu	Enhancing multiple fault diagnosis in combinational circuits based on sensitized paths and EB testing.	Asian Test Symposium	1995	DBLP DOI BibTeX RDF	electron beam testing, multiple fault diagnosis, sensitized paths, EB testing, TP-1, TP-2, TP-3, TP-4, electron-beam tester, internal lines, VLSI, fault diagnosis, logic testing, combinational circuits, combinational circuits, fault location, fault location, stuck-at faults, diagnostic resolution
19	David Eppstein	Finding the k Shortest Paths	FOCS	1994	DBLP DOI BibTeX RDF	maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths
19	Philip N. Klein, Sairam Subramanian	A linear-processor polylog-time algorithm for shortest paths in planar graphs	FOCS	1993	DBLP DOI BibTeX RDF	linear-processor polylog-time algorithm, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, shortest paths, planar graphs, separators, decomposition tree
19	Noga Alon, Zvi Galil, Oded Margalit, Moni Naor	Witnesses for Boolean Matrix Multiplication and for Shortest Paths	FOCS	1992	DBLP DOI BibTeX RDF	subcubic methods, shortest paths, deterministic algorithm, transitive closure, witnesses, Boolean matrix multiplication
19	Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi	Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths	FOCS	1992	DBLP DOI BibTeX RDF	k-fault tolerant graph, performance degradation, disjoint paths, perfect hash functions
19	Greg N. Frederickson	Planar Graph Decomposition and All Pairs Shortest Paths.	J. ACM	1991	DBLP DOI BibTeX RDF	succinct encoding, approximation algorithm, NP-completeness, planar graph, graph embedding, all pairs shortest paths, outerplanar graph, compact routing table
19	Michael L. Fredman, Dan E. Willard	Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths	FOCS	1990	DBLP DOI BibTeX RDF	Fibonacci heap, trans-dichotomous algorithms, fusion tree method, information-theoretic limitations, atomic heap, amortized time, heap size, AF-heap, data structure, shortest paths, minimum spanning trees, linear-time algorithm, shortest-path algorithm
19	Greg N. Frederickson	Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version)	FOCS	1989	DBLP DOI BibTeX RDF	topological embedding, cellular graph embeddings, shortest path information, time complexity, shortest paths problems