Cited By
View all- Georgiadis LItaliano GKaranasiou A(2019)Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed GraphTheoretical Computer Science10.1016/j.tcs.2019.09.040Online publication date: Sep-2019
Addendum to “Dominator Tree Certification and Divergent Spanning Trees”
Article No.: 56, Pages 1 - 3
References
[1]
S. Baswana, K. Choudhary, and L. Roditty. 2015. Fault tolerant reachability for directed graphs. In Distributed Computing. Lecture Notes in Computer Science, Vol. 9363. Springer, 528--543.
[2]
L. Georgiadis and R. E. Tarjan. 2015. Dominator tree certification and divergent spanning trees. ACM Transactions on Algorithms 12, 1, Article No. 11.
Index Terms
- Addendum to “Dominator Tree Certification and Divergent Spanning Trees”
Recommendations
Dominator Tree Certification and Divergent Spanning Trees
Special Issue on SODA'12 and Regular PapersHow does one verify that the output of a complicated program is correct? One can formally prove that the program is correct, but this may be beyond the power of existing methods. Alternatively, one can check that the output produced for a particular ...
2-Edge Connectivity in Directed Graphs
Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly, not much has been investigated for directed graphs. In this article, we study 2-edge ...
2-vertex connectivity in directed graphs
AbstractGiven a directed graph, two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. In this paper, we show how to compute this relation ...
Comments
Information & Contributors
Information
Published In
September 2016
310 pages
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 August 2016
Accepted: 01 April 2016
Received: 01 April 2016
Published in TALG Volume 12, Issue 4
Check for updates
Author Tags
Qualifiers
- Note
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 152Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Georgiadis LItaliano GKaranasiou A(2019)Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed GraphTheoretical Computer Science10.1016/j.tcs.2019.09.040Online publication date: Sep-2019
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in