Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Mathematics of computing → Paths and connectivity problems"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ibiapina, Allen, Silva, Ana
In the study of temporal graphs, only paths respecting the flow of time are relevant. In this context, many concepts of walks disjointness have been proposed over the years, and the validity of Menger’s Theorem, as well as the complexity of related
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04f85e4ed484d907e7e4b7a31cb0845c
http://arxiv.org/abs/2302.06653
http://arxiv.org/abs/2302.06653
Autor:
Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I., Zirondelli, Elia C.
Publikováno v:
40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
In a strongly connected graph G = (V,E), a cut arc (also called strong bridge) is an arc e ∈ E whose removal makes the graph no longer strongly connected. Equivalently, there exist u,v ∈ V, such that all u-v walks contain e. Cut arcs are a fundam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99ddfffeda5509ee6d7a231361d80282
In the shortest path interdiction problem, an interdictor aims to remove arcs of total cost at most a given budget from a directed graph with given arc costs and traversal times such that the length of a shortest s-t-path is maximized. For static gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4a18ded8d5be9b705c9a0029d8e25a5
Visitors and Rewriters are a well-known and powerful design pattern for processing regular data structures in a declarative way, while still writing imperative code. The authors' "umod" model generator creates Java data models from a concise and alge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e475f0869cc548f20e867da22d7c9ee9
Autor:
Liu, Yang P.
An important open question in the area of vertex sparsification is whether $(1+\epsilon)$-approximate cut-preserving vertex sparsifiers with size close to the number of terminals exist. The work Chalermsook et al. (SODA 2021) introduced a relaxation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50f015dd35ea1da6fb8b630d7cf2aeca
Publikováno v:
Leibniz International Proceedings in Informatics, LIPIcs
A temporal graph G = (G_1, G_2, ..., G_T) is a graph represented by a sequence of T graphs over a common set of vertices, such that at the i-th time step only the edge set E_i is active. The temporal graph exploration problem asks for a shortest temp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7aa8b28fa34839074720b2c585f2c4bd
http://livrepository.liverpool.ac.uk/3156375/1/main.pdf
http://livrepository.liverpool.ac.uk/3156375/1/main.pdf
The Flight Planning Problem is to find a minimum fuel trajectory between two airports in a 3D airway network under consideration of the wind. We show that this problem is NP-hard, even in its most basic version. We then present a novel A* heuristic,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ef031a505de9dd57cee017c45af3f11
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19753a37740f965274159d7f92b57a5
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee4feba6a7425c51d63f41832c606963
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
https://drops.dagstuhl.de/opus/volltexte/2022/16937/