An O(| V| 2) algorithm for single connectedness

A directed graph G=( V, E) is said to be singly connected if u⇝v implies that there is at most one simple path from u to v for all vertices u, v∈ V. In this paper we design an algorithm to test a graph for being singly connected that takes O(| V| 2) steps.

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 72; no. 3; pp. 105 - 107
Main Author Khuller, Samir
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 26.11.1999
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithms
Analysis of algorithms
Combinatorics
Combinatorics. Ordered structures
Connectivity
Depth first search
Directed graphs
Exact sciences and technology
Graph theory
Graphs
Information processing
Mathematics
Reachability
Sciences and techniques of general use
Singly connected
Studies
Theory
Connectivity
Depth first search
Analysis of algorithms
Singly connected
Directed graphs
Reachability
Connected graph
Connectedness
Graph theory
Algorithm
Directed graph
Search algorithm
Complexity
Online AccessGet full text
ISSN0020-0190
1872-6119
DOI10.1016/S0020-0190(99)00135-0

Cover

More Information
Summary:A directed graph G=( V, E) is said to be singly connected if u⇝v implies that there is at most one simple path from u to v for all vertices u, v∈ V. In this paper we design an algorithm to test a graph for being singly connected that takes O(| V| 2) steps.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(99)00135-0