Shortest Paths for Line Segments

to connected objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
Informatik-Berichte ; 125

Classification
Mathematik

Event
Veröffentlichung
(where)
Hagen
(who)
FernUniversität in Hagen
(when)
2018
Creator
Icking, Christian
Rote, Günter
Welzl, Emo
Yap, Chee

URN
urn:nbn:de:hbz:708-dh6753
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
25.03.2025, 1:46 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

Time of origin

  • 2018

Other Objects (12)

Universal Shortest Paths

Universal Shortest Paths

Shortest Paths II

zweidimensionales bewegtes Bild

Shortest Paths II

Timetable information and shortest paths

Timetable information and shortest paths

Most Diverse Near-Shortest Paths

Most Diverse Near-Shortest Paths

Shortest Paths III / Network Flows

zweidimensionales bewegtes Bild

Shortest Paths III / Network Flows

Constrained shortest paths and related problems

Hochschulschrift

Constrained shortest paths and related problems

Unobstructed shortest paths in polyhedral environments

Unobstructed shortest paths in polyhedral environments

Drawing Shortest Paths in Geodetic Graphs

Drawing Shortest Paths in Geodetic Graphs

Encoding Shortest Paths in Spatial Networks

Encoding Shortest Paths in Spatial Networks

Shortest edge disjoint paths in graphs

Hochschulschrift

Shortest edge disjoint paths in graphs

Constrained shortest paths and related problems

Hochschulschrift | Online-Publikation

Constrained shortest paths and related problems

Engineering shortest paths and layout algorithms for large graphs

Engineering shortest paths and layout algorithms for large graphs

Related objects