Dynamic trees as search trees via euler tours, applied to the network simplex algorithm

Saved in:
Bibliographic Details
Published in:Mathematical programming Vol. 78; no. 2; pp. 169 - 177
Main Author: Tarjan, Robert E.
Format: Journal Article Conference Proceeding
Language:English
Published: Heidelberg Springer 01.08.1997
Subjects:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Algorithms
Simplex method
Network
Graph theory
Search tree
Abstract data type
Implementation
ISSN:0025-5610, 1436-4646
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Author Tarjan, Robert E.
Author_xml – sequence: 1
  givenname: Robert E.
  surname: Tarjan
  fullname: Tarjan, Robert E.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2754831$$DView record in Pascal Francis
BookMark eNptkEtLAzEUhYMo2FY3_oIsXImjN5PJPJZarQoFN4rL4U5yx0bnRZKq_fe2tCKIq8OB7zuLM2b7Xd8RYycCLgRAdnk9gzgViUyLPTbaZJSkSbrPRgCxilQq4JCNvX8DACHzfMReblYdtlbz4Ig8R889odOLXf-wyGnZkOOhXzp_znEYGktmXXlYEO8ofPbunXvbDg19cWxee2fDoj1iBzU2no53OWHPs9un6X00f7x7mF7NIx2rPER5oSDHWhZCiYJETLmppDGqrgotlTEoSaeprBIBVW7AQJxlRmWk4irTBoWcsNPt7oBeY1M77LT15eBsi25VxplKcrnBYItp13vvqC61DRhs3wWHtikFlJv_yt__1srZH-Vn9B_4G_BUclQ
CODEN MHPGA4
CitedBy_id crossref_primary_10_1287_moor_2023_0055
crossref_primary_10_1016_j_tust_2025_106623
crossref_primary_10_1186_s41072_023_00155_8
crossref_primary_10_1016_j_future_2025_108097
crossref_primary_10_1109_TITS_2020_3019791
crossref_primary_10_1109_JIOT_2022_3197242
crossref_primary_10_1109_TC_2014_2315631
crossref_primary_10_1016_j_cor_2024_106851
crossref_primary_10_1109_ACCESS_2023_3267538
crossref_primary_10_1109_TEVC_2019_2928991
crossref_primary_10_1287_moor_25_1_76_15208
crossref_primary_10_1103_2rds_k4n9
crossref_primary_10_1145_1498698_1594231
crossref_primary_10_1371_journal_pcbi_1007939
crossref_primary_10_1002_net_21470
crossref_primary_10_1016_j_ejor_2019_08_042
crossref_primary_10_1016_j_ejor_2020_08_018
crossref_primary_10_1145_1596527_1596530
crossref_primary_10_14778_3407790_3407839
crossref_primary_10_1137_120864271
crossref_primary_10_1145_3729269
crossref_primary_10_1002_net_21517
crossref_primary_10_1007_s00182_021_00789_7
crossref_primary_10_1016_j_ejor_2016_11_024
crossref_primary_10_1142_S0218202525500113
crossref_primary_10_1287_ijoo_2018_0004
crossref_primary_10_1109_TEVC_2011_2173579
crossref_primary_10_1145_1103963_1103966
crossref_primary_10_1007_s00453_020_00774_8
Cites_doi 10.1145/321694.321699
10.1145/48014.61051
10.1145/3828.3835
10.1016/0022-0000(83)90006-5
10.1145/225058.225269
10.1287/moor.16.2.272
10.1109/SFCS.1991.185429
10.1016/0304-3975(94)90159-7
10.1137/0214041
10.1137/0214055
10.1145/76359.76368
10.1007/BF02579168
10.1007/BF01594940
10.1137/0214061
10.1109/SFCS.1978.3
10.1007/BF00288683
10.1007/BF01580869
10.1109/SFCS.1985.43
10.1016/0020-0190(83)90099-6
10.1137/1.9781611970265
10.1287/moor.15.3.430
ContentType Journal Article
Conference Proceeding
Copyright 1997 INIST-CNRS
Copyright_xml – notice: 1997 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1007/BF02614369
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Applied Sciences
EISSN 1436-4646
EndPage 177
ExternalDocumentID 2754831
10_1007_BF02614369
GrantInformation_xml – fundername: Consiglio nationale delle ricerche
– fundername: Hewlett Packard Italy Ltd
– fundername: IBM SEMEA
– fundername: Mathematical Programming Society
– fundername: Università di Pisa
– fundername: Italian Society of Operation Research
GroupedDBID --K
--Z
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1B1
1N0
1OL
1SB
203
28-
29M
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
6TJ
78A
7WY
88I
8AO
8FE
8FG
8FL
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDBF
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACSTC
ACUHS
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADXHL
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMOZ
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFFHD
AFFNX
AFGCZ
AFHIU
AFKRA
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHQJS
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMVHM
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
AZQEC
B-.
B0M
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EAD
EAP
EBA
EBLON
EBR
EBS
EBU
ECS
EDO
EIOEI
EJD
EMI
EMK
EPL
ESBYG
EST
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IAO
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAS
LLZTM
M0C
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQ-
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9R
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RPZ
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TH9
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WH7
WK8
XPP
YLTOR
Z45
ZL0
ZMTXR
ZWQNP
~02
~8M
~EX
AAYZH
AESKC
IQODW
RIG
ID FETCH-LOGICAL-c258t-89508af391519e12e8db3dd5fb9c35dda3ec663b410b8d0d0277d57e52b7cda13
IEDL.DBID RSV
ISICitedReferencesCount 70
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1007_BF02614369&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0025-5610
IngestDate Mon Jul 21 09:14:03 EDT 2025
Sat Nov 29 05:49:00 EST 2025
Tue Nov 18 20:54:19 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Algorithms
Simplex method
Network
Graph theory
Search tree
Abstract data type
Implementation
Language English
License http://www.springer.com/tdm
CC BY 4.0
LinkModel DirectLink
MeetingName Network optimization: Algorithms and applications
MergedId FETCHMERGED-LOGICAL-c258t-89508af391519e12e8db3dd5fb9c35dda3ec663b410b8d0d0277d57e52b7cda13
PageCount 9
ParticipantIDs pascalfrancis_primary_2754831
crossref_citationtrail_10_1007_BF02614369
crossref_primary_10_1007_BF02614369
PublicationCentury 1900
PublicationDate 1997-08-01
PublicationDateYYYYMMDD 1997-08-01
PublicationDate_xml – month: 08
  year: 1997
  text: 1997-08-01
  day: 01
PublicationDecade 1990
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Mathematical programming
PublicationYear 1997
Publisher Springer
Publisher_xml – name: Springer
References D. Sleator (BF02614369_CR21) 1983; 26
R.E. Tarjan (BF02614369_CR25) 1983
BF02614369_CR6
A.V. Goldberg (BF02614369_CR12) 1989; 36
R.E. Tarjan (BF02614369_CR23) 1991; 16
BF02614369_CR4
BF02614369_CR8
S. Bent (BF02614369_CR3) 1985; 14
D. Goldfarb (BF02614369_CR14) 1990; 47
J.B. Orlin (BF02614369_CR20) 1997; 78
A.V. Goldberg (BF02614369_CR13) 1990; 15
R. Bayer (BF02614369_CR2) 1972; 1
R.E. Tarjan (BF02614369_CR24) 1983; 16
A.V. Goldberg (BF02614369_CR10) 1991; 50
BF02614369_CR16
H.N. Gabow (BF02614369_CR9) 1986; 6
BF02614369_CR17
G.N. Frederickson (BF02614369_CR7) 1985; 14
BF02614369_CR19
D. Sleator (BF02614369_CR22) 1985; 32
P.B. Miltersen (BF02614369_CR18) 1994; 130
A.V. Goldberg (BF02614369_CR11) 1988; 35
BF02614369_CR15
G.M. Adel’son-Vel’skii (BF02614369_CR1) 1962; 3
R.E. Tarjan (BF02614369_CR26) 1985; 14
J. Edmonds (BF02614369_CR5) 1972; 19
References_xml – volume: 19
  start-page: 248
  year: 1972
  ident: BF02614369_CR5
  publication-title: J. Assoc. Comput. Mach.
  doi: 10.1145/321694.321699
– volume: 35
  start-page: 921
  year: 1988
  ident: BF02614369_CR11
  publication-title: J. Assoc. Comput. Mach.
  doi: 10.1145/48014.61051
– volume: 32
  start-page: 652
  year: 1985
  ident: BF02614369_CR22
  publication-title: J. Assoc. Comput. Mach.
  doi: 10.1145/3828.3835
– volume: 26
  start-page: 362
  year: 1983
  ident: BF02614369_CR21
  publication-title: J. Computer and System Sciences
  doi: 10.1016/0022-0000(83)90006-5
– ident: BF02614369_CR16
  doi: 10.1145/225058.225269
– volume: 16
  start-page: 272
  year: 1991
  ident: BF02614369_CR23
  publication-title: Math. of Oper. Res.
  doi: 10.1287/moor.16.2.272
– ident: BF02614369_CR8
  doi: 10.1109/SFCS.1991.185429
– volume: 130
  start-page: 203
  year: 1994
  ident: BF02614369_CR18
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(94)90159-7
– volume: 14
  start-page: 545
  year: 1985
  ident: BF02614369_CR3
  publication-title: SIAM J. Computing
  doi: 10.1137/0214041
– volume: 14
  start-page: 781
  year: 1985
  ident: BF02614369_CR7
  publication-title: SIAM J. Comput.
  doi: 10.1137/0214055
– volume: 36
  start-page: 873
  year: 1989
  ident: BF02614369_CR12
  publication-title: J. Assoc. Comput. Mach.
  doi: 10.1145/76359.76368
– volume: 6
  start-page: 109
  year: 1986
  ident: BF02614369_CR9
  publication-title: Combinatorica
  doi: 10.1007/BF02579168
– volume: 50
  start-page: 277
  year: 1991
  ident: BF02614369_CR10
  publication-title: Math. Prog.
  doi: 10.1007/BF01594940
– volume: 14
  start-page: 862
  year: 1985
  ident: BF02614369_CR26
  publication-title: SIAM J. Comput.
  doi: 10.1137/0214061
– ident: BF02614369_CR15
  doi: 10.1109/SFCS.1978.3
– volume: 3
  start-page: 1259
  year: 1962
  ident: BF02614369_CR1
  publication-title: Soviet Math. Dokl.
– ident: BF02614369_CR19
– volume: 1
  start-page: 173
  year: 1972
  ident: BF02614369_CR2
  publication-title: Acta Inform
  doi: 10.1007/BF00288683
– ident: BF02614369_CR6
– volume: 47
  start-page: 353
  year: 1990
  ident: BF02614369_CR14
  publication-title: Mathematical Programming
  doi: 10.1007/BF01580869
– ident: BF02614369_CR17
  doi: 10.1109/SFCS.1985.43
– volume: 16
  start-page: 253
  year: 1983
  ident: BF02614369_CR24
  publication-title: Information Processing Letters
  doi: 10.1016/0020-0190(83)90099-6
– volume-title: Data Structures and Network Algorithms,CBMS 44
  year: 1983
  ident: BF02614369_CR25
  doi: 10.1137/1.9781611970265
– ident: BF02614369_CR4
– volume: 15
  start-page: 430
  year: 1990
  ident: BF02614369_CR13
  publication-title: Math. of Oper. Res.
  doi: 10.1287/moor.15.3.430
– volume: 78
  start-page: 109
  year: 1997
  ident: BF02614369_CR20
  publication-title: Mathematical Programming
SSID ssj0001388
Score 1.8123794
SourceID pascalfrancis
crossref
SourceType Index Database
Enrichment Source
StartPage 169
SubjectTerms Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Title Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
Volume 78
WOSCitedRecordID wos10_1007_BF02614369&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: Springer Nature Link Journals
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEB5K8aCIb7FqZcFeBAPZbB6bo6jFi0V89lb2FQ20aUnS4s93t5vGFhR6HJgMYXbZ-ZaZ_T6ADiWhDHkQO1yXV8cnXDqUE99h-rbBPcXdhCZzsYmo16P9fvzUgM6_HXxDJKpRvk9C80oPh56RKXh-ea-PW0woXeiyGjCwykFafbpSdbYnrNAJSKxyxVI56e6u9yN7sFPBRXRj13cfGio7gK0lEkFtPdbMq8UhfNxZiXlkus0FYgWye7myZylDajpUOSp16OIaMYtCtYl0FJTZqXBUpIY1-Bux4ec4T8uv0RG8de9fbx-cSjzBEV5AS4caeVeWGP53HCvsKSo5kTJIeCxIICUjSmi0wX3scipdaXq5MohU4PFISIbJMTSzcaZOABlKtTAhgrBA-K55WqthgIqoENiMqcgWXC2SOxAVs7gRuBgOFpzIv6lrwWXtO7F8Gn96tVfWqHb1In3DIvh0rShnsGnJZs243jk0y3yq2rAhZmVa5BfzXfQDD72-4g
linkProvider Springer Nature
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=proceeding&rft.title=Mathematical+programming&rft.atitle=Dynamic+trees+as+search+trees+via+Euler+tours%2C+applied+to+the+network+simplex+algorithm&rft.au=TARJAN%2C+R.+E&rft.date=1997-08-01&rft.pub=Springer&rft.issn=0025-5610&rft.volume=78&rft.issue=2&rft.spage=169&rft.epage=177&rft_id=info:doi/10.1007%2FBF02614369&rft.externalDBID=n%2Fa&rft.externalDocID=2754831
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon