A minimum spanning tree algorithm with inverse-Ackermann type complexity

Saved in:
Bibliographic Details
Published inJournal of the ACM
Format Journal Article
LanguageEnglish
Published 01.11.2000
Online AccessGet full text
ISSN1557-735X
0004-5411
DOI10.1145/355541.355562

Cover

BookMark eNotjz1PwzAURT2UoRRGdv-BBL88Ox9jVAFFqsQCElvkuK_FInYsJ6Xk35MqLPcsV1f33LKV7z0x9gAiBZDqEZVSEtIr8mzF1qBUkRSoPtdsV3NnvXVnx4egvbf-xMdIxHV36qMdvxy_zMmt_6E4UFKbb4puLvJxCsRN70JHv3ac7tjNUXcD3f9zwz6en963u2T_9vK6rfeJkXkxJq3AUuQgqzIv5zPimBk9szVSVaAqxKJCLSWItoAyOyCRxgwyccC2Uiha3LB02T37oKeL7romROt0nBoQzVW3WXSbRRf_ADDdTDM
CitedBy_id crossref_primary_10_1111_itor_13260
crossref_primary_10_1137_070693217
crossref_primary_10_1145_959122_959123
crossref_primary_10_1016_j_ins_2014_10_012
crossref_primary_10_1109_ACCESS_2021_3094541
crossref_primary_10_1007_s00186_017_0604_2
crossref_primary_10_3390_a12030058
crossref_primary_10_1002_net_21928
crossref_primary_10_1155_2023_8591115
crossref_primary_10_1177_1473871612439644
crossref_primary_10_34198_ejms_14424_841871
crossref_primary_10_1109_ACCESS_2023_3327011
crossref_primary_10_1137_120880185
crossref_primary_10_1007_s00453_007_9016_7
crossref_primary_10_1371_journal_pone_0017445
crossref_primary_10_1017_S0963548323000445
crossref_primary_10_1007_s00453_012_9683_x
crossref_primary_10_1109_TPAMI_2010_200
crossref_primary_10_1080_0305215X_2012_658781
crossref_primary_10_1007_s40305_022_00437_1
crossref_primary_10_1016_j_neucom_2008_05_003
crossref_primary_10_1016_j_asoc_2020_106676
crossref_primary_10_1145_375827_375847
crossref_primary_10_7163_PrzG_2019_2_4
crossref_primary_10_1002_net_21464
crossref_primary_10_1016_j_jmva_2013_05_004
crossref_primary_10_1109_TPDS_2005_72
crossref_primary_10_1145_1367064_1367071
crossref_primary_10_1186_1471_2105_9_242
crossref_primary_10_1137_110825698
crossref_primary_10_1016_j_asoc_2018_10_046
crossref_primary_10_1007_s00453_021_00879_8
crossref_primary_10_1007_s10732_012_9200_z
crossref_primary_10_1002_net_22040
crossref_primary_10_1007_s11590_024_02170_5
crossref_primary_10_1109_TPAMI_2008_173
crossref_primary_10_1007_s10601_012_9119_x
crossref_primary_10_1109_TEVC_2002_807275
crossref_primary_10_1007_s10852_011_9165_1
crossref_primary_10_1109_TVLSI_2008_2001950
crossref_primary_10_1145_2794075
crossref_primary_10_1007_s10589_020_00251_6
crossref_primary_10_1287_opre_1080_0607
crossref_primary_10_1088_0957_0233_17_6_022
crossref_primary_10_1016_j_ipl_2011_08_005
crossref_primary_10_1002_wics_204
crossref_primary_10_1007_s11590_024_02113_0
crossref_primary_10_1109_TAP_2010_2044348
crossref_primary_10_1109_TEVC_2020_2966014
crossref_primary_10_1145_1328911_1328916
crossref_primary_10_1007_s11554_018_0804_x
crossref_primary_10_1016_j_ejor_2016_08_054
crossref_primary_10_1137_090759112
crossref_primary_10_1016_j_iot_2023_101023
crossref_primary_10_1016_j_cor_2012_02_023
crossref_primary_10_1142_S021987621100271X
crossref_primary_10_1016_j_orl_2006_12_004
crossref_primary_10_1088_1367_2630_12_8_085009
crossref_primary_10_1016_j_ipl_2007_06_004
crossref_primary_10_1007_s11276_014_0748_4
crossref_primary_10_1016_j_tcs_2011_11_029
crossref_primary_10_1137_23M1545975
crossref_primary_10_1137_20M1359201
crossref_primary_10_1007_s10288_020_00434_1
crossref_primary_10_1016_j_asoc_2020_106928
crossref_primary_10_1137_110832689
crossref_primary_10_1016_j_cor_2006_02_023
crossref_primary_10_1016_j_comnet_2005_06_015
crossref_primary_10_1016_j_jpdc_2011_11_004
crossref_primary_10_1166_mex_2021_2081
crossref_primary_10_1109_TIT_2006_871578
crossref_primary_10_1117_1_JMI_4_2_027502
crossref_primary_10_1016_j_jda_2009_07_002
crossref_primary_10_1002_rsa_20115
crossref_primary_10_1137_23M1612019
crossref_primary_10_1016_j_ejor_2015_10_003
crossref_primary_10_1016_j_ins_2010_12_004
crossref_primary_10_1145_1198513_1198517
crossref_primary_10_1016_j_jda_2014_03_002
crossref_primary_10_1142_S0219525908002021
crossref_primary_10_1145_2836167
crossref_primary_10_1016_S0304_3975_03_00402_X
crossref_primary_10_1016_j_displa_2022_102275
crossref_primary_10_1007_s11590_023_02058_w
crossref_primary_10_1111_brv_12545
crossref_primary_10_1002_cpe_2950
crossref_primary_10_1109_LRA_2024_3427559
crossref_primary_10_1016_j_orl_2004_08_008
crossref_primary_10_1016_j_neucom_2024_129054
crossref_primary_10_1007_s00454_022_00432_6
crossref_primary_10_1145_355541_355554
crossref_primary_10_1287_mnsc_2021_3955
crossref_primary_10_1016_j_cosrev_2008_10_002
crossref_primary_10_1137_S0097539702419650
crossref_primary_10_1088_1742_6596_1325_1_012120
crossref_primary_10_1016_j_compbiolchem_2020_107285
crossref_primary_10_1145_2822907
crossref_primary_10_1016_j_imavis_2009_06_017
crossref_primary_10_1016_j_ifacol_2023_10_484
crossref_primary_10_1103_PhysRevE_81_021130
crossref_primary_10_1287_ijoc_2022_0291
crossref_primary_10_1137_S0097539702403244
crossref_primary_10_1145_505241_505243
crossref_primary_10_4028_www_scientific_net_AMM_613_408
ContentType Journal Article
DBID ADTOC
UNPAY
DOI 10.1145/355541.355562
DatabaseName Unpaywall for CDI: Periodical Content
Unpaywall
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 10.1145/355541.355562
GroupedDBID --Z
-DZ
-~X
.DC
.GJ
29L
3R3
4.4
41~
5GY
5VS
85S
8US
8VB
9M8
AAHTB
AAIKC
AAKMM
AALFJ
AAMNW
AAYFX
ABCQX
ABFSI
ABPEJ
ABPPZ
ACGOD
ACM
ACNCT
ADBCU
ADL
ADMLS
ADTOC
AEBYY
AEFXT
AEGXH
AEJOY
AEMOZ
AENEX
AENSD
AETEA
AFWIH
AFWXC
AGHSJ
AHQJS
AI.
AIKLT
AKRVB
AKVCP
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ASPBG
AVWKF
BDXCO
CCLIF
CS3
D0L
DU5
E.L
EBS
EJD
FA8
FEDTE
GUFHI
HF~
HGAVV
H~9
IAO
ICD
IEA
IOF
ITC
IVC
K1G
L7B
LHSKQ
MVM
OHT
P-O
P1C
PQQKQ
QWB
RNS
ROL
TAE
TH9
TN5
UKR
UNPAY
UPT
VH1
WH7
XJT
XOL
XSW
YQT
ZCA
ZCG
ZL0
ZY4
ID FETCH-LOGICAL-c467t-b038061498685620f2ca562bc45915933793a4410b7182d3eea32120d3b9530b3
IEDL.DBID UNPAY
ISSN 1557-735X
0004-5411
IngestDate Wed Oct 01 15:31:43 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c467t-b038061498685620f2ca562bc45915933793a4410b7182d3eea32120d3b9530b3
OpenAccessLink https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/355541.355562
ParticipantIDs unpaywall_primary_10_1145_355541_355562
PublicationCentury 2000
PublicationDate 2000-11-01
PublicationDateYYYYMMDD 2000-11-01
PublicationDate_xml – month: 11
  year: 2000
  text: 2000-11-01
  day: 01
PublicationDecade 2000
PublicationTitle Journal of the ACM
PublicationYear 2000
Score 2.14445
SourceID unpaywall
SourceType Open Access Repository
Title A minimum spanning tree algorithm with inverse-Ackermann type complexity
URI https://dl.acm.org/doi/pdf/10.1145/355541.355562
UnpaywallVersion publishedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_G9qA-OD_xmzwIPmXGpenaxyLKEBwKDubTSJpUh203Rosff72XphXZk740L0l7HLm7X5O73wGca4MomAlGEdrG-OAJDaQYUOMlJrYBiVXJmPcjfzj27iZi0gLW1MLoFN-TVVf41qYXOqkJbcUlRkbhXfXsYJ1uxxeIvtvQGY8eomeHcj2KMxxFKn5vwMWkodVcXb8Ba2W-kJ_vMk1_BZTbLjw2org8krdeWahe_LXC0vgfWbdgs0aXJHLbYRtaJt-BbtO5gdSGvAvDiFhOkazMCHqUqmsRsdfTRKYv8-WseM2IPaAls9xmbRga2eSLDCcSe2RLqjx084EAfg_GtzdP10Na91SgMbrEgirGA_sTGAZ-gKKxpB9LHFXsiRCRDedorxIhElMYtPqaGyM5RjemuQoFZ4rvQzuf5-YAiOZJKP0Y45unPSkQN4gk7EuldWJJ0NghXPyoeLpw3BlTVwctpk5BU6egoz_PPIb1qha-KgY8gXaxLM0pooJCndUb4RvYna1E
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_G9qA-OD_xmzwIPmXGpenaxyLKEBwKDubTSJpUh203Rosff72XphXZk740L0l7HLm7X5O73wGca4MomAlGEdrG-OAJDaQYUOMlJrYBiVXJmPcjfzj27iZi0gLW1MLoFN-TVVf41qYXOqkJbcUlRkbhXfXsYJ1uxxeIvtvQGY8eomeHcj2KMxxFKn5vwMWkodVcXb8Ba2W-kJ_vMk1_BZTbLjw2org8krdeWahe_LXC0vgfWbdgs0aXJHLbYRtaJt-BbtO5gdSGvAvDiFhOkazMCHqUqmsRsdfTRKYv8-WseM2IPaAls9xmbRga2eSLDCcSe2RLqjx084EAfg_GtzdP10Na91SgMbrEgirGA_sTGAZ-gKKxpB9LHFXsiRCRDedorxIhElMYtPqaGyM5RjemuQoFZ4rvQzuf5-YAiOZJKP0Y45unPSkQN4gk7EuldWJJ0NghXPyoeLpw3BlTVwctpk5BU6egoz_PPIb1qha-KgY8gXaxLM0pooJCndUb4RvYna1E
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+minimum+spanning+tree+algorithm+with+inverse-Ackermann+type+complexity&rft.jtitle=Journal+of+the+ACM&rft.date=2000-11-01&rft.issn=1557-735X&rft_id=info:doi/10.1145%2F355541.355562&rft.externalDocID=10.1145%2F355541.355562
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1557-735X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1557-735X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1557-735X&client=summon