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 in	Information processing letters Vol. 72; no. 3; pp. 105 - 107
Main Author	Khuller, Samir
Format	Journal Article
Language	English
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 Access	Get full text
ISSN	0020-0190 1872-6119
DOI	10.1016/S0020-0190(99)00135-0

Cover

Abstract	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.
AbstractList	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. An 0 (absolute value V squared) algorithm for single connectedness is examined.
Author	Khuller, Samir
Author_xml	– sequence: 1 givenname: Samir surname: Khuller fullname: Khuller, Samir email: samir@cs.umd.edu organization: Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1241051$$DView record in Pascal Francis
BookMark	eNqFkEtLAzEURoMo2FZ_gjCIC7sYe5NMMhNcSBFfUOjCxzZkkkxNGZOaTAXBH-_UioIbV3dzznfhDNGuD94idIThDAPmk3sAAjlgAadCjAEwZTnsoAGuSpJzjMUuGvwg-2iY0hIAeEHLAZpMfTY__ciePjIyzlS7CNF1zy9ZE2KWnF-0NtPBe6s7a7xN6QDtNapN9vD7jtDj9dXD5W0-m9_cXU5nuaacdjmHqmpsU5cKs1qZQtQlq7ChzBTUkkYrXihDSguCKAaKlbysa14wEAYXwA0doePt7iqG17VNnVyGdfT9S0loSSqgBe-hk29IJa3aJiqvXZKr6F5UfJeYFBgY7jG2xXQMKUXb_BIgNwXlV0G5ySOFkF8FJfTe-R9Pu051LvguKtf-a19sbdtnenM2yqSd9doaF_uc0gT3z8InhyeJAA
CODEN	IFPLAT
CitedBy_id	crossref_primary_10_1016_S0004_3702_03_00110_3 crossref_primary_10_1016_j_ipl_2015_04_008 crossref_primary_10_1016_S0020_0190_00_00054_5 crossref_primary_10_1016_j_tcs_2022_08_012
ContentType	Journal Article
Copyright	1999 2000 INIST-CNRS Copyright Elsevier Sequoia S.A. Nov 26, 1999
Copyright_xml	– notice: 1999 – notice: 2000 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Nov 26, 1999
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/S0020-0190(99)00135-0
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Mathematics
EISSN	1872-6119
EndPage	107
ExternalDocumentID	47857738 1241051 10_1016_S0020_0190_99_00135_0 S0020019099001350
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c363t-6088fefb7a15bad49b7581d35d43e2fca64ad27e092a50a5767bb64509d1406d3
IEDL.DBID	AIKHN
ISSN	0020-0190
IngestDate	Mon Jul 14 07:25:56 EDT 2025 Mon Jul 21 09:17:07 EDT 2025 Wed Oct 01 01:57:43 EDT 2025 Thu Apr 24 23:03:50 EDT 2025 Fri Feb 23 02:28:02 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Connectivity Depth first search Analysis of algorithms Singly connected Directed graphs Reachability Connected graph Connectedness Graph theory Algorithm Directed graph Search algorithm Complexity
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c363t-6088fefb7a15bad49b7581d35d43e2fca64ad27e092a50a5767bb64509d1406d3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
PQID	237280346
PQPubID	45522
PageCount	3
ParticipantIDs	proquest_journals_237280346 pascalfrancis_primary_1241051 crossref_primary_10_1016_S0020_0190_99_00135_0 crossref_citationtrail_10_1016_S0020_0190_99_00135_0 elsevier_sciencedirect_doi_10_1016_S0020_0190_99_00135_0
ProviderPackageCode	CITATION AAYXX
PublicationCentury	1900
PublicationDate	1999-11-26
PublicationDateYYYYMMDD	1999-11-26
PublicationDate_xml	– month: 11 year: 1999 text: 1999-11-26 day: 26
PublicationDecade	1990
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Information processing letters
PublicationYear	1999
Publisher	Elsevier B.V Elsevier Science Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier Science – name: Elsevier Sequoia S.A
References	Cormen, Leiserson, Rivest (ID004) 1989 Cormen (10.1016/S0020-0190(99)00135-0_ID004) 1989
References_xml	– year: 1989 ident: ID004 publication-title: Introduction to Algorithms – year: 1989 ident: 10.1016/S0020-0190(99)00135-0_ID004
SSID	ssj0006437
Score	1.5628462
Snippet	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... An 0 (absolute value V squared) algorithm for single connectedness is examined.
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	105
SubjectTerms	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
Title	An O(\| V\| 2) algorithm for single connectedness
URI	https://dx.doi.org/10.1016/S0020-0190(99)00135-0 https://www.proquest.com/docview/237280346
Volume	72
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier Science Direct Freedom Collection customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: ACRLP dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIKHN dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AKRWK dateStart: 19930125 isFulltext: true providerName: Library Specific Holdings
link	http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwGP3QeRHE3-LUSQ4e9FDXNGnaHMdQpoJeVLyFNEl1MLeh8yb-7eZrU4eICF4DScpL8vJ9zUsewBEuIkHzOMpMatHCjEZSpCwqE87yQtrUuEogey0Gd_zyIX1YgH5zFwZllYH7a06v2DqUdAOa3elwiHd8UQ8k8WTHxzGYty_5_SfPW7DUu7gaXH8RMp5N1UoP1GDJeH6Rp26kKjyW8qRqJ4p_26JWpvrVA1fWjhc_yLvakc7XYTWEkqRXf-0GLLjxJqw1Ng0krNot6PbG5Ob4ndy_k-SE6NHj5GU4e3omPlwl-Kdg5IhBuYvxwScS3zbcnZ_d9gdR8EmIDBNsFgnPFKUri0zTtNCWy8InAdSy1HLmktJowbVNMhfLRKex9hlGVhSC-1DB-vRKWLYDrfFk7HaBZNSlWawtyzF1EKaQ2kpu0D89803xNvAGGmXCI-LoZTFSc7WYR1QhokpKVSGq4jacflWb1q9o_FUhb3BX36aD8kz_V9XOt3Gad5igpJW2Yb8ZNxXW66tKWGXTxcXe_zveh-XqTQdKo0QcQGv28uY6PmKZFYewePpBD8O8_ARoXt-6
linkProvider	Elsevier
linkToHtml	http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LSgMxFA2iCwXxLdZnFi7sYtqZvKZZiljqq26sdBcySUYLtS217sRvNzczYxERwW0gyXCSnNw7OclB6BQWkUhacZQabsHCLImk4DTKCaOtTFpuXBDIdkWnx677vL-ALqq7MCCrLLm_4PTA1mVJs0SzORkM4I4v6IEknOz4OAby9iXGSQoZWONjrvOAk6lC5wEKLBnPr_EUTYTCMynroZUo_m2DWp3oVw9bXvhd_KDusB-1N9BaGUji8-JbN9GCG22h9cqkAZdrdhs1z0f4_uwdP75jUsd6-DSeDmbPL9gHqxj-EwwdNiB2MT70BNrbQb325cNFJypdEiJDBZ1FwvNE7vIs1QnPtGUy8ylAYim3jDqSGy2YtiR1sSSax9rnF2mWCeYDBeuTK2HpLlocjUduD-E0cTyNtaUtSByEyaS2khlwT099U6yGWAWNMuUT4uBkMVRzrZhHVAGiSkoVEFVxDTW-qk2KNzT-qtCqcFffJoPyPP9X1aNv4zTvkICgNamhg2rcVLlaXxWhwaSLif3_d3yCljsPd7fq9qp7c4BWwusOSRIRcYgWZ9M3d-Rjl1l2HObmJzA-4II
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+O%28%7CV%7C2%29+algorithm+for+single+connectedness&rft.jtitle=Information+processing+letters&rft.au=Khuller%2C+Samir&rft.date=1999-11-26&rft.issn=0020-0190&rft.volume=72&rft.issue=3-4&rft.spage=105&rft.epage=107&rft_id=info:doi/10.1016%2FS0020-0190%2899%2900135-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0020_0190_99_00135_0
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon