Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Witnesses for Boolean matrix multiplication and for transitive closure
Journal of Complexity
Context-free recognition via shortest paths computation: a version of Valiant's algorithm
Theoretical Computer Science
On the all-pairs-shortest-path problem in unweighted undirected graphs
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Perspectives on database theory
ACM SIGACT News
All pairs shortest paths for graphs with small integer length edges
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
HP Way: How Bill Hewlett and I Built Our Company
HP Way: How Bill Hewlett and I Built Our Company
Inventing the Electronic Century: The Epic Story of the Consumer Electronics and Computer Science Industries
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Formal-Language-Constrained Path Problems
SIAM Journal on Computing
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Information and Computation
Fred Terman at Stanford: Building a Discipline, a University, and Silicon Valley
Fred Terman at Stanford: Building a Discipline, a University, and Silicon Valley
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Quickest path distances on context-free labeled graphs
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
| Hi-index | 0.00 |
This paper starts by discussing an algorithmic view of labeled path problems. In particular, we apply Seidel's all-pairs shortest-path algorithm for undirected and unweighted graphs to a basic problem in labeled paths. Seidel's algorithm is applied to find unlabeled paths between any pairs of nodes in a labeled graph whose associated context-free grammar G can generate the empty string ε. Our result is a corollary of Seidel's algorithm. Then we mention a number of diverse labeled path applications. Labeled path problems are then used to demonstrate some concepts and insights about research and development. We briefly discuss their place in building our intellectual infrastructure as well as their potential contributions to modern business and entrepreneurship. We attempt to give a broad perspective to research and development from their intellectual foundations to their place in modern business and entrepreneurship. It serves as a high-level sketch rather than a comprehensive discussion.