A linear algorithm for centering a spanning tree of a biconnected graph

We present a linear-time algorithm for finding a spanning tree of a biconnected graph with a given vertex as its center.

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 51; no. 3; pp. 121 - 124
Main Authors Easwarakumar, K.S., Rangan, C.Pandu, Cheston, G.A.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 10.08.1994
Elsevier Science
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Biconnected graphs
Center
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Spanning tree
st-numbering
Theoretical computing
st-numbering
Center
Algorithms
Biconnected graphs
Spanning tree
Graph
Numbering
Algorithm
Online AccessGet full text

Cover

Abstract We present a linear-time algorithm for finding a spanning tree of a biconnected graph with a given vertex as its center.
AbstractList We present a linear-time algorithm for finding a spanning tree of a biconnected graph with a given vertex as its center.
Author Cheston, G.A.
Easwarakumar, K.S.
Rangan, C.Pandu
Author_xml – sequence: 1
  givenname: K.S.
  surname: Easwarakumar
  fullname: Easwarakumar, K.S.
  organization: Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India
– sequence: 2
  givenname: C.Pandu
  surname: Rangan
  fullname: Rangan, C.Pandu
  email: rangan@iitm.ernet.in
  organization: Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India
– sequence: 3
  givenname: G.A.
  surname: Cheston
  fullname: Cheston, G.A.
  organization: Department of Computer Science, University of Saskatchewan, Saskatoon, Canada
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4195519$$DView record in Pascal Francis
BookMark eNp9kEFLw0AQhRepYFv9Bx724EEP0Zlssm0uQilahYIXPS-TzaRdSTdhNwj-exMrPXqaYXhvZr43ExPfehbiGuEeAfUDQAoJYAG3RXYHAFon6ZmY4nKRJhqxmIjpSXIhZjF-jqJMLaZis5KN80xBUrNrg-v3B1m3QVr2PQfnd5Jk7Mj7se0Ds2zrYVQ623rPtudK7gJ1-0txXlMT-eqvzsXH89P7-iXZvm1e16ttYpVSfbKwFVGqh2cqQAIolwpUDlppgKXmNEeusSxApVmpkFhXpS6BK2QEW5JSc5Ed99rQxhi4Nl1wBwrfBsGMYZiR1IykpsjMbxgmHWw3R1tH0VJTB_LWxZM3wyLPsRhkj0cZDwhfjoOJ1rG3XLkwwJqqdf_f-QEtcnMl
CODEN IFPLAT
CitedBy_id crossref_primary_10_1016_0020_0190_96_00102_0
crossref_primary_10_1115_1_2802484
Cites_doi 10.1090/S0002-9947-1932-1501641-2
10.1016/0304-3975(76)90086-4
10.1016/0020-0190(89)90051-3
ContentType Journal Article
Copyright 1994
1994 INIST-CNRS
Copyright_xml – notice: 1994
– notice: 1994 INIST-CNRS
DBID IQODW
AAYXX
CITATION
DOI 10.1016/0020-0190(94)00066-2
DatabaseName Pascal-Francis
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1872-6119
EndPage 124
ExternalDocumentID 10_1016_0020_0190_94_00066_2
4195519
0020019094000662
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-
ABPIF
IQODW
AAXKI
AAYXX
AFJKZ
AKRWK
CITATION
ID FETCH-LOGICAL-c333t-7cdaa26020d01a00b8303506360086e251ef1b90324b31ae6db6b0ed1e10cba33
ISSN 0020-0190
IngestDate Thu Sep 26 18:31:17 EDT 2024
Sun Oct 29 17:09:16 EDT 2023
Fri Feb 23 02:28:02 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords st-numbering
Center
Algorithms
Biconnected graphs
Spanning tree
Graph
Numbering
Algorithm
Language English
License CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c333t-7cdaa26020d01a00b8303506360086e251ef1b90324b31ae6db6b0ed1e10cba33
PageCount 4
ParticipantIDs crossref_primary_10_1016_0020_0190_94_00066_2
pascalfrancis_primary_4195519
elsevier_sciencedirect_doi_10_1016_0020_0190_94_00066_2
PublicationCentury 1900
PublicationDate 1994-08-10
PublicationDateYYYYMMDD 1994-08-10
PublicationDate_xml – month: 08
  year: 1994
  text: 1994-08-10
  day: 10
PublicationDecade 1990
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 1994
Publisher Elsevier B.V
Elsevier Science
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science
References Even (BIB2) 1979
Even, Tarjan (BIB3) 1976; 2
Cheston, Farley, Heidetneimi, Proskurowski (BIB1) 1989; 32
Knuth (BIB4) 1985; Vol. 1
Whitney (BIB5) 1932
Knuth (10.1016/0020-0190(94)00066-2_BIB4) 1985; Vol. 1
Even (10.1016/0020-0190(94)00066-2_BIB3) 1976; 2
Whitney (10.1016/0020-0190(94)00066-2_BIB5) 1932
Cheston (10.1016/0020-0190(94)00066-2_BIB1) 1989; 32
Even (10.1016/0020-0190(94)00066-2_BIB2) 1979
References_xml – volume: 2
  start-page: 339
  year: 1976
  end-page: 344
  ident: BIB3
  article-title: Computing an
  publication-title: Theoret. Comput. Sci.
  contributor:
    fullname: Tarjan
– volume: 32
  start-page: 247
  year: 1989
  end-page: 250
  ident: BIB1
  article-title: Centering a spanning tree of a biconnected graph
  publication-title: Inform. Process. Lett.
  contributor:
    fullname: Proskurowski
– volume: Vol. 1
  year: 1985
  ident: BIB4
  publication-title: The Art of Computer Programming
  contributor:
    fullname: Knuth
– year: 1932
  ident: BIB5
  article-title: Non-Separable and planar graphs
  publication-title: Trans. Amer. Math. Soc.
  contributor:
    fullname: Whitney
– year: 1979
  ident: BIB2
  article-title: Graph Algorithms
  contributor:
    fullname: Even
– year: 1932
  ident: 10.1016/0020-0190(94)00066-2_BIB5
  article-title: Non-Separable and planar graphs
  publication-title: Trans. Amer. Math. Soc.
  doi: 10.1090/S0002-9947-1932-1501641-2
  contributor:
    fullname: Whitney
– volume: 2
  start-page: 339
  year: 1976
  ident: 10.1016/0020-0190(94)00066-2_BIB3
  article-title: Computing an st-numbering
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(76)90086-4
  contributor:
    fullname: Even
– volume: Vol. 1
  year: 1985
  ident: 10.1016/0020-0190(94)00066-2_BIB4
  contributor:
    fullname: Knuth
– year: 1979
  ident: 10.1016/0020-0190(94)00066-2_BIB2
  contributor:
    fullname: Even
– volume: 32
  start-page: 247
  year: 1989
  ident: 10.1016/0020-0190(94)00066-2_BIB1
  article-title: Centering a spanning tree of a biconnected graph
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(89)90051-3
  contributor:
    fullname: Cheston
SSID ssj0006437
Score 1.4534677
Snippet We present a linear-time algorithm for finding a spanning tree of a biconnected graph with a given vertex as its center.
SourceID crossref
pascalfrancis
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 121
SubjectTerms Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Biconnected graphs
Center
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Spanning tree
st-numbering
Theoretical computing
Title A linear algorithm for centering a spanning tree of a biconnected graph
URI https://dx.doi.org/10.1016/0020-0190(94)00066-2
Volume 51
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fa9RAEF5q-yJItVWxamUfLChHYja7zWUfQ9EWD0vRFvsWZpNN7Q9zx92VQv96Z7Kb5Epb1L6EsCQbmJmdfLM73wxj70WaRCVab4C6rgKVFDIwQqoAEM2V23FR6JL4zt_2k70j9fV4-7jf0G_YJXMTFtd38koeolUcQ70SS_Y_NNtNigN4j_rFK2oYr_-k42xAIBGmA7g4GWOU_-t3kzVICZfWsQ8H6DCapkSUUW4dGdKg8tG7FoQ1-5YTZ21Ke0dnHEwciYDevmhYPz3-htkVTOG8zc8ehT_C_sSoPnG7qjvhAdTlZZ9BYGc-WX83zMJ-v8EVDqb6r_0m2C0ijCcFUH6b6_wZWudL02GMkan3iN7Z-uqyp4uxeOM5hSNK-5-wcMTqW_7dbTV0X0MQrtVWrBvk5GmUN6tn06P0JPV_p2L3j9hKjC4JfeFKNvr-c9T9tekA06UDualbmqVIPnVjH7T66D91H4x5MoEZLq7KdUVZgCqHz9iqjzF45gxmjS3Zep09bft3cO_On7PdjDv74Z39cNQ-7-yHA2_th5P98HGFQwv2wxv7ecGOvnw-3NkLfGONoJBSzoNhUQJgIBvjMhUQRSaVdMBMpeMwwrUIeW0ljI4QbBspwCalSUxkS2FFVBiQ8iVbrse1fcW4AAQ0BmFQKiuVSIkAHoYxRCkobSqTbrCglVM-cfVT8jaxkOSak1xzrfJGrnm8wYatMHOPAR22y9EE_vLm5g3Zd59TQmNYoF8_eOY37HG_EN6y5fn00m4iFJ2bd96K_gCAdH_t
link.rule.ids 315,783,787,27936,27937
linkProvider Library Specific Holdings
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=A+linear+algorithm+for+centering+a+spanning+tree+of+a+biconnected+graph&rft.jtitle=Information+processing+letters&rft.au=Easwarakumar%2C+K.S.&rft.au=Rangan%2C+C.Pandu&rft.au=Cheston%2C+G.A.&rft.date=1994-08-10&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=51&rft.issue=3&rft.spage=121&rft.epage=124&rft_id=info:doi/10.1016%2F0020-0190%2894%2900066-2&rft.externalDocID=0020019094000662
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