Parsing flowcharts and series-parallel graphs.
- Author:
- Jacobo Valdes Ayesta
Abstract
No abstract available.
Cited By
- Winter C (2024). Poset Ramsey number R(P,Q ). III. Chain compositions and antichains, Discrete Mathematics, 347:7, Online publication date: 1-Jul-2024.
- Dornemann J and Schrader R (2021). Cross–series–parallel digraphs, Discrete Applied Mathematics, 303:C, (57-65), Online publication date: 15-Nov-2021.
Xu Y, Agrawal K and Lee I Efficient Parallel Determinacy Race Detection for Structured Futures Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, (398-409)- Singer K, Goldstein N, Muller S, Agrawal K, Lee I and Acar U Priority Scheduling for Interactive Applications Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, (465-477)
- Xu Y, Singer K and Lee I Parallel determinacy race detection for futures Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, (217-231)
- Singer K, Xu Y and Lee I Proactive work stealing for futures Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, (257-271)
- Utterback R, Agrawal K, Fineman J and Lee I Efficient race detection with futures Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, (340-354)
- Xu Y, Lee I and Agrawal K (2018). Efficient parallel determinacy race detection for two-dimensional dags, ACM SIGPLAN Notices, 53:1, (368-380), Online publication date: 23-Mar-2018.
- Xu Y, Lee I and Agrawal K Efficient parallel determinacy race detection for two-dimensional dags Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, (368-380)
- Agrawal K, Devietti J, Fineman J, Lee I, Utterback R and Xu C Race detection and reachability in nearly series-parallel DAGs Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (156-171)
- Polyvyanyy A, Vanhatalo J and Völzer H Simplified computation and generalization of the refined process structure tree Proceedings of the 7th international conference on Web services and formal methods, (25-41)
- Vanhatalo J, Völzer H and Koehler J (2009). The refined process structure tree, Data & Knowledge Engineering, 68:9, (793-818), Online publication date: 1-Sep-2009.
- Acar U, Blelloch G and Blumofe R The data locality of work stealing Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, (1-12)
- Feng M and Leiserson C Efficient detection of determinacy races in Cilk programs Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, (1-11)
- Johnson R, Pearson D and Pingali K The program structure tree Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (171-185)
- Johnson R, Pearson D and Pingali K (1994). The program structure tree, ACM SIGPLAN Notices, 29:6, (171-185), Online publication date: 1-Jun-1994.
- Tarjan R and Valdes J Prime subprogram parsing of a program Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (95-105)
Recommendations
Nonempty intersection of longest paths in series-parallel graphs
In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, the answer to Gallai's question is positive for several well-known classes ...
The circular chromatic number of series-parallel graphs
In this article, we consider the circular chromatic number χc(G) of series-parallel graphs G. It is well known that series-parallel graphs have chromatic number at most 3. Hence, their circular chromatic numbers are at most 3. If a series-parallel graph ...
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, ź(n2) is the established upper and lower bound on the worst-case area. A long-standing open problem is to determine for what graphs a smaller area can be ...