Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
s-t paths
Description:
An s-t path is a path in a graph that begins at a designated vertex s and ends at a designated vertex t.
Primary topic:
Complexity and Algorithms in Graphs (54%)
Related topics:
Complexity and Algorithms in Graphs (54%),
Advanced Graph Theory Research (28%)
OpenAlex ID:
keywords/s-t-paths
Length-bounded cuts and flows
2010
·
Georg Baier
, Thomas Erlebach
, et al.
·
ACM Transactions on Algorithms
·
90
Shortest paths between shortest paths
2011
·
Marcin Kamiński
, Paul Medvedev
, et al.
·
Theoretical Computer Science
·
80
PDF
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
2006
·
B. Vatinlen
, F. Chauvet
, et al.
·
European Journal of Operational Research
·
65
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
2010
·
Loukas Georgiadis
·
Lecture notes in computer science
·
51
Edge-packing of graphs and network reliability
1988
·
Charles J. Colbourn
·
Discrete Mathematics
·
42
PDF
Minimum d-blockers and d-transversals in graphs
2010
·
Marie-Christine Costa
, Dominique de Werra
, et al.
·
Journal of Combinatorial Optimization
·
40
Length-Bounded Cuts and Flows
2006
·
Georg Baier
, Thomas Erlebach
, et al.
·
Lecture notes in computer science
·
35
Complexity of the path avoiding forbidden pairs problem revisited
2013
·
Jakub Kováč
·
Discrete Applied Mathematics
·
34
PDF
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
2010
·
Patrick Briest
, Parinya Chalermsook
, et al.
·
Lecture notes in computer science
·
28
PDF
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
2019
·
René van Bevern
, Till Fluschnik
, et al.
·
Networks
·
18
PDF
Fast Compilation of s-t Paths on a Graph for Counting and Enumeration.
2017
·
Norihito Yasuda
, Teruji Sugaya
, et al.
·
18
Combinatorial Online Prediction via Metarounding
2013
·
Takahiro Fujita
, Kohei Hatano
, et al.
·
Lecture notes in computer science
·
17
PDF
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
2009
·
Xie-Bin Chen
·
Information Processing Letters
·
17
Resilience of wireless sensor networks
2011
·
Tseng, Kuan-Chieh Robert
·
cIRcle (University of British Columbia)
·
15
Detours in directed graphs
2023
·
Fedor V. Fomin
, Petr A. Golovach
, et al.
·
Journal of Computer and System Sciences
·
14
Linear-time algorithms for finding Hamiltonian and longest ( s , t ) -paths in C -shaped grid graphs
2019
·
Fatemeh Keshavarz-Kohjerdi
, Alireza Bagheri
·
Discrete Optimization
·
14
PDF
On paths, trails and closed trails in edge-colored graphs
2012
·
Laurent Gourvès
, Adria Lyra
, et al.
·
Discrete Mathematics & Theoretical Computer Science
·
14
PDF
The Complexity of Bottleneck Labeled Graph Problems
2007
·
Refael Hassin
, Jérôme Monnot
, et al.
·
Lecture notes in computer science
·
14
Parameterized Algorithms for Diverse Multistage Problems
2021
·
Kellerhals, Leon
, Renken, Malte
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
13
PDF
A Polynomial Sized Kernel for Tracking Paths Problem
2019
·
Aritra Banik
, Pratibha Choudhary
, et al.
·
Algorithmica
·
13
Quadratic bottleneck problems
2011
·
Abraham P. Punnen
, Ruonan Zhang
·
Naval Research Logistics (NRL)
·
13
Fixed-Parameter Tractable Algorithms for Tracking Set Problems
2018
·
Aritra Banik
, Pratibha Choudhary
·
Lecture notes in computer science
·
12
Configurations with few crossings in topological graphs
2006
·
Christian Knauer
, Étienne Schramm
, et al.
·
Computational Geometry
·
12
PDF
Enumeration of all simple paths in a directed graph using Petri net: A systematic approach
1983
·
G.S. Hura
·
Microelectronics Reliability
·
12
Asymmetric Traveling Salesman Path and Directed Latency Problems
2010
·
Zachary Friggstad
, Mohammad R. Salavatipour
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
11
Show more works
View as search
Works count:
124
Citation count:
986
Year
Topic
Type