Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
path existence
Description:
A decision or reachability question in graph theory and computer science concerning whether a path satisfying specified conditions exists.
Related topics:
Advanced Graph Theory Research (19%),
Complexity and Algorithms in Graphs (12%),
Interconnection Networks and Systems (8%),
Robotic Path Planning Algorithms (7%)
OpenAlex ID:
keywords/path-existence
Lower bounds on communication complexity
1987
·
Pavol Duris
, Zvi Galil
, et al.
·
Information and Computation
·
80
The complexity of evaluating path expressions in SPARQL
2012
·
Katja Losemann
, Wim Martens
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
77
A unified approach for deciding the existence of certain petri net paths
1992
·
Hsu-Chun Yen
·
Information and Computation
·
75
PDF
Panconnectivity of locally twisted cubes
2005
·
Meijie Ma
, Jun-Ming Xu
·
Applied Mathematics Letters
·
69
PDF
Many-to-many disjoint paths in faulty hypercubes
2009
·
Xie-Bin Chen
·
Information Sciences
·
65
Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach
2014
·
Veloso, Renê R.
, Cerf, Loïc
, et al.
·
Movebank
·
60
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
1998
·
Greg Barnes
, Jonathan F. Buss
, et al.
·
SIAM Journal on Computing
·
58
Disconnection proofs for motion planning
2002
·
J. Basch
, L.J. Guibas
, et al.
·
Proceedings - IEEE International Conference on Robotics and Automation/Proceedings
·
55
Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey
2018
·
Shuya Chiba
, Tomoki Yamashita
·
Graphs and Combinatorics
·
43
Paths and edge-connectivity in graphs
1984
·
Haruko Okamura
·
Journal of Combinatorial Theory Series B
·
29
PDF
On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields
2019
·
Florent Guepin
, Christoph Haase
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
25
PDF
A "Piano Movers" Problem Reformulated
2013
·
David Wilson
, James H. Davenport
, et al.
·
International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
·
24
PDF
Light paths in 4-connected graphs in the plane and other surfaces
2000
·
Bojan Mohar
·
Journal of Graph Theory
·
24
On vertex-degree restricted paths in polyhedral graphs
2000
·
Igor Fabrici
, Erhard Hexel
, et al.
·
Discrete Mathematics
·
23
Creating small roadmaps for solving motion planning problems
2005
·
Roland Gerærts
, M.H. Overmars
·
Utrecht University Repository (Utrecht University)
·
20
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
2021
·
Glos, Adam
, Kokainis, Martins
, et al.
·
arXiv (Cornell University)
·
14
PDF
Existence of A-avoiding paths in abstract polytopes
1974
·
Ilan Adler
, George Dantzig
, et al.
·
Mathematical programming studies
·
14
Sequential Boolean Equations
1969
·
S. Even
, A.R. Meyer
·
IEEE Transactions on Computers
·
14
Graph Reachability and Pebble Automata over Infinite Alphabets
2009
·
Tony Tan
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
13
Explicit construction of linear sized tolerant networks
2006
·
N. Alon
, F.R.K. Chung
·
Discrete Mathematics
·
13
Longest paths in digraphs
1981
·
J. C. Bermond
, A. Germa
, et al.
·
COMBINATORICA
·
13
An O ( n ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
2017
·
Diptarka Chakraborty
, Raghunath Tewari
·
ACM Transactions on Computation Theory
·
12
RSD Fault Block Model for Highly Efficient Fault-Tolerant Manhattan Routing Algorithms in 2D Mesh
2016
·
Hongzhi Zhao
, Yuan Xue
·
The Computer Journal
·
12
Lattice-based computation of Boolean functions
2010
·
Mustafa Altun
, Marc D. Riedel
·
ACM/IEEE Design Automation Conference (DAC)
·
12
An interior-point path-following algorithm for computing a Leontief economy equilibrium
2010
·
Chuangyin Dang
, Yinyu Ye
, et al.
·
Computational Optimization and Applications
·
11
Show more works
View as search
Works count:
94
Citation count:
1,003
Year
Topic
Type