No label defined (Q5743390)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7053271

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7053271

Statements

scholarly article

0 references

0 references

Christian Sommer

0 references

publication date

10 May 2019

0 references

full work available at URL

https://arxiv.org/abs/1011.5549

0 references

https://dl.acm.org/citation.cfm?id=2095135

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Planar spanners and approximate shortest path queries among obstacles in the plane

0 references

VC-Dimension and Shortest Path Algorithms

0 references

0 references

Linear time algorithms for NP-hard problems restricted to partial k- trees

0 references

Algorithms and Computation

0 references

Approximation algorithms for NP-complete problems on planar graphs

0 references

Preprocessing Speed-Up Techniques Is Hard

0 references

The Shortcut Problem – Complexity and Approximation

0 references

Fast Routing in Road Networks with Transit Nodes

0 references

Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time

0 references

Many distances in planar graphs

0 references

Shortest path queries in planar graphs

0 references

Shortest paths in digraphs of small treewidth. I: Sequential algorithms

0 references

Diameter and treewidth in minor-closed graph families, revisited

0 references

A note on two problems in connexion with graphs

0 references

Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions

0 references

Improved algorithms for dynamic shortest paths

0 references

Subgraph Isomorphism in Planar Graphs and Related Problems

0 references

Diameter and treewidth in minor-closed graph families

0 references

Compact Navigation and Distance Oracles for Graphs with Small Treewidth

0 references

0 references

Planar graphs, negative weight edges, shortest paths, and near linear time

0 references

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications

0 references

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

0 references

Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time

0 references

Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time

0 references

S-functions for graphs

0 references

0 references

Faster shortest-path algorithms for planar graphs

0 references

An external memory data structure for shortest path queries

0 references

Efficient Algorithms for Shortest Paths in Sparse Networks

0 references

Oracles for bounded-length shortest paths in planar graphs

0 references

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs

0 references

0 references

0 references

A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights

0 references

Experimental and Efficient Algorithms

0 references

Shortest paths in directed planar graphs with negative lengths

0 references

Finding small simple cycle separators for 2-connected planar graphs

0 references

Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time

0 references

Improved Distance Queries in Planar Graphs

0 references

Distance Oracles beyond the Thorup--Zwick Bound

0 references

Graph minors. II. Algorithmic aspects of tree-width

0 references

Graph minors. X: Obstructions to tree-decomposition

0 references

All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

0 references

Algorithms – ESA 2005

0 references

Call routing and the ratcatcher

0 references

Distance Oracles for Sparse Graphs

0 references

Compact oracles for reachability and approximate distances in planar digraphs

0 references

Computing the dilation of edge-augmented graphs in metric spaces

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5743390

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5743390&oldid=36492048"