default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/networks/networks21.bht:"
download as .bib file
@article{DBLP:journals/networks/AdlakhaGK91,
author = {Veena Adlakha and
Barbara Gladysz and
Jerzy Kamburowski},
title = {Minimum flows in (s, \emph{t}) planar networks},
journal = {Networks},
volume = {21},
number = {7},
pages = {767--773},
year = {1991},
url = {https://doi.org/10.1002/net.3230210705},
doi = {10.1002/NET.3230210705},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AdlakhaGK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AlexopoulosF91,
author = {Christos Alexopoulos and
George S. Fishman},
title = {Characterizing stochastic flow networks using the monte carlo method},
journal = {Networks},
volume = {21},
number = {7},
pages = {775--798},
year = {1991},
url = {https://doi.org/10.1002/net.3230210706},
doi = {10.1002/NET.3230210706},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AlexopoulosF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AliH91,
author = {Agha Iqbal Ali and
Chung{-}Hsing Huang},
title = {Balanced spanning forests and trees},
journal = {Networks},
volume = {21},
number = {6},
pages = {667--687},
year = {1991},
url = {https://doi.org/10.1002/net.3230210605},
doi = {10.1002/NET.3230210605},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AliH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AminSS91,
author = {Ashok T. Amin and
Kyle Siegrist and
Peter J. Slater},
title = {On the nonexistence of uniformly optimal graphs for pair-connected
reliability},
journal = {Networks},
volume = {21},
number = {3},
pages = {359--368},
year = {1991},
url = {https://doi.org/10.1002/net.3230210307},
doi = {10.1002/NET.3230210307},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AminSS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AvisD91,
author = {David Avis and
Michel Deza},
title = {The cut cone, \emph{L}\({}^{\mbox{1}}\) embeddability, complexity,
and multicommodity flows},
journal = {Networks},
volume = {21},
number = {6},
pages = {595--617},
year = {1991},
url = {https://doi.org/10.1002/net.3230210602},
doi = {10.1002/NET.3230210602},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AvisD91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BalinskiG91,
author = {Michel L. Balinski and
Jaime Gonzalez},
title = {Maximum matchings in bipartite graphs via strong spanning trees},
journal = {Networks},
volume = {21},
number = {2},
pages = {165--179},
year = {1991},
url = {https://doi.org/10.1002/net.3230210203},
doi = {10.1002/NET.3230210203},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BalinskiG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BallPS91,
author = {Michael O. Ball and
J. Scott Provan and
Douglas R. Shier},
title = {Reliability covering problems},
journal = {Networks},
volume = {21},
number = {3},
pages = {345--357},
year = {1991},
url = {https://doi.org/10.1002/net.3230210306},
doi = {10.1002/NET.3230210306},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BallPS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BermondT91,
author = {Jean{-}Claude Bermond and
Dvora Tzvieli},
title = {Minimal diameter double-loop networks: Dense optimal families},
journal = {Networks},
volume = {21},
number = {1},
pages = {1--9},
year = {1991},
url = {https://doi.org/10.1002/net.3230210102},
doi = {10.1002/NET.3230210102},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BermondT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoeschLS91,
author = {Francis T. Boesch and
Xiaoming Li and
Charles L. Suffel},
title = {On the existence of uniformly optimally reliable networks},
journal = {Networks},
volume = {21},
number = {2},
pages = {181--194},
year = {1991},
url = {https://doi.org/10.1002/net.3230210204},
doi = {10.1002/NET.3230210204},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoeschLS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrandeauC91,
author = {Margaret L. Brandeau and
Samuel S. Chiu},
title = {Parametric analysis of optimal facility locations},
journal = {Networks},
volume = {21},
number = {2},
pages = {223--243},
year = {1991},
url = {https://doi.org/10.1002/net.3230210207},
doi = {10.1002/NET.3230210207},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrandeauC91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrighamD91,
author = {Robert C. Brigham and
Ronald D. Dutton},
title = {A compilation of relations between graph invariants - supplement {I}},
journal = {Networks},
volume = {21},
number = {4},
pages = {421--455},
year = {1991},
url = {https://doi.org/10.1002/net.3230210405},
doi = {10.1002/NET.3230210405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrighamD91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrzozowskiGM91,
author = {Janusz A. Brzozowski and
T. Gahlinger and
Farhad Mavaddat},
title = {Consistency and satisfiability of waveform timing specifications},
journal = {Networks},
volume = {21},
number = {1},
pages = {91--107},
year = {1991},
url = {https://doi.org/10.1002/net.3230210107},
doi = {10.1002/NET.3230210107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrzozowskiGM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChenR91,
author = {Yong{-}Mao Chen and
Prakash Ramanan},
title = {Euclidean shortest path in the presence of obstacles},
journal = {Networks},
volume = {21},
number = {3},
pages = {257--265},
year = {1991},
url = {https://doi.org/10.1002/net.3230210302},
doi = {10.1002/NET.3230210302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChenR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChoiS91,
author = {Sang{-}Bang Choi and
Arun K. Somani},
title = {The generalized folding-cube network},
journal = {Networks},
volume = {21},
number = {3},
pages = {267--294},
year = {1991},
url = {https://doi.org/10.1002/net.3230210303},
doi = {10.1002/NET.3230210303},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChoiS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChopraR91,
author = {Sunil Chopra and
M. R. Rao},
title = {On the multiway cut polyhedron},
journal = {Networks},
volume = {21},
number = {1},
pages = {51--89},
year = {1991},
url = {https://doi.org/10.1002/net.3230210106},
doi = {10.1002/NET.3230210106},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChopraR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DawsonF91,
author = {Robert J. Dawson and
Abdel Aziz Farrag},
title = {Fault-tolerant extensions of star networks},
journal = {Networks},
volume = {21},
number = {4},
pages = {373--385},
year = {1991},
url = {https://doi.org/10.1002/net.3230210402},
doi = {10.1002/NET.3230210402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DawsonF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EgelandH91,
author = {Thore Egeland and
Arne Bang Huseby},
title = {On dependence and reliability computations},
journal = {Networks},
volume = {21},
number = {5},
pages = {521--545},
year = {1991},
url = {https://doi.org/10.1002/net.3230210504},
doi = {10.1002/NET.3230210504},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EgelandH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldfarbHK91,
author = {Donald Goldfarb and
Jianxiu Hao and
Sheng{-}Roan Kai},
title = {Shortest path algorithms using dynamic breadth-first search},
journal = {Networks},
volume = {21},
number = {1},
pages = {29--50},
year = {1991},
url = {https://doi.org/10.1002/net.3230210105},
doi = {10.1002/NET.3230210105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldfarbHK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Gusfield91,
author = {Dan Gusfield},
title = {Efficient algorithms for inferring evolutionary trees},
journal = {Networks},
volume = {21},
number = {1},
pages = {19--28},
year = {1991},
url = {https://doi.org/10.1002/net.3230210104},
doi = {10.1002/NET.3230210104},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Gusfield91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GusfieldN91,
author = {Dan Gusfield and
Dalit Naor},
title = {Efficient algorithms for generalized cut-trees},
journal = {Networks},
volume = {21},
number = {5},
pages = {505--520},
year = {1991},
url = {https://doi.org/10.1002/net.3230210503},
doi = {10.1002/NET.3230210503},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GusfieldN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hagstrom91,
author = {Jane N. Hagstrom},
title = {Computing rooted communication reliability in an almost acyclic digraph},
journal = {Networks},
volume = {21},
number = {5},
pages = {581--593},
year = {1991},
url = {https://doi.org/10.1002/net.3230210507},
doi = {10.1002/NET.3230210507},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hagstrom91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HsuW91,
author = {Lih{-}Hsing Hsu and
Shih{-}Yih Wang},
title = {Maximum independent number for series-parallel networks},
journal = {Networks},
volume = {21},
number = {4},
pages = {457--468},
year = {1991},
url = {https://doi.org/10.1002/net.3230210406},
doi = {10.1002/NET.3230210406},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HsuW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/IchimoriK91,
author = {Tetsuo Ichimori and
Naoki Katoh},
title = {A two-commodity sharing problem on networks},
journal = {Networks},
volume = {21},
number = {5},
pages = {547--563},
year = {1991},
url = {https://doi.org/10.1002/net.3230210505},
doi = {10.1002/NET.3230210505},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/IchimoriK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KashiwabaraMNF91,
author = {Toshinobu Kashiwabara and
Sumio Masuda and
Kazuo Nakajima and
Toshio Fujisawa},
title = {Polynomial time algorithms on circular-arc overlap graphs},
journal = {Networks},
volume = {21},
number = {2},
pages = {195--203},
year = {1991},
url = {https://doi.org/10.1002/net.3230210205},
doi = {10.1002/NET.3230210205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KashiwabaraMNF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KhangF91,
author = {Do Ba Khang and
Okitsugu Fujiwara},
title = {Approximate solutions of capacitated fixed-charge minimum cost network
flow problems},
journal = {Networks},
volume = {21},
number = {6},
pages = {689--704},
year = {1991},
url = {https://doi.org/10.1002/net.3230210606},
doi = {10.1002/NET.3230210606},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KhangF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LinM91,
author = {Shiow C. Lin and
Eva Ma},
title = {Sensitivity analysis of 0-1 multiterminal network flows},
journal = {Networks},
volume = {21},
number = {7},
pages = {713--745},
year = {1991},
url = {https://doi.org/10.1002/net.3230210703},
doi = {10.1002/NET.3230210703},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LinM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Mata-Montero91,
author = {Erick Mata{-}Montero},
title = {Resilience of partial \emph{k}-tree networks with edge and node failures},
journal = {Networks},
volume = {21},
number = {3},
pages = {321--344},
year = {1991},
url = {https://doi.org/10.1002/net.3230210305},
doi = {10.1002/NET.3230210305},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Mata-Montero91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MulveyV91,
author = {John M. Mulvey and
Hercules Vladimirou},
title = {Solving multistage stochastic networks: An application of scenario
aggregation},
journal = {Networks},
volume = {21},
number = {6},
pages = {619--643},
year = {1991},
url = {https://doi.org/10.1002/net.3230210603},
doi = {10.1002/NET.3230210603},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MulveyV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MyrvoldCPP91,
author = {Wendy J. Myrvold and
Kim H. Cheung and
Lavon B. Page and
Jo Ellen Perry},
title = {Uniformly-most reliable networks do not always exist},
journal = {Networks},
volume = {21},
number = {4},
pages = {417--419},
year = {1991},
url = {https://doi.org/10.1002/net.3230210404},
doi = {10.1002/NET.3230210404},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MyrvoldCPP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NagamochiI91,
author = {Hiroshi Nagamochi and
Toshihide Ibaraki},
title = {Maximum flows in probabilistic networks},
journal = {Networks},
volume = {21},
number = {6},
pages = {645--666},
year = {1991},
url = {https://doi.org/10.1002/net.3230210604},
doi = {10.1002/NET.3230210604},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/NagamochiI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NagurneyZ91,
author = {Anna Nagurney and
Lan Zhao},
title = {A network equilibrium formulation of market disequilibrium and variational
inequalities},
journal = {Networks},
volume = {21},
number = {1},
pages = {109--132},
year = {1991},
url = {https://doi.org/10.1002/net.3230210108},
doi = {10.1002/NET.3230210108},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/NagurneyZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Oellermann91,
author = {Ortrud R. Oellermann},
title = {Conditional graph connectivity relative to hereditary properties},
journal = {Networks},
volume = {21},
number = {2},
pages = {245--255},
year = {1991},
url = {https://doi.org/10.1002/net.3230210208},
doi = {10.1002/NET.3230210208},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Oellermann91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/OrdaR91,
author = {Ariel Orda and
Raphael Rom},
title = {Minimum weight paths in time-dependent networks},
journal = {Networks},
volume = {21},
number = {3},
pages = {295--319},
year = {1991},
url = {https://doi.org/10.1002/net.3230210304},
doi = {10.1002/NET.3230210304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/OrdaR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Qiu91,
author = {Yuping Qiu},
title = {Solution properties of oligopolistic network equilibria},
journal = {Networks},
volume = {21},
number = {5},
pages = {565--580},
year = {1991},
url = {https://doi.org/10.1002/net.3230210506},
doi = {10.1002/NET.3230210506},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Qiu91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Reid91,
author = {K. B. Reid},
title = {Centroids to centers in trees},
journal = {Networks},
volume = {21},
number = {1},
pages = {11--17},
year = {1991},
url = {https://doi.org/10.1002/net.3230210103},
doi = {10.1002/NET.3230210103},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Reid91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RussellG91,
author = {Robert A. Russell and
Dave Gribbin},
title = {A multiphase approach to the period routing problem},
journal = {Networks},
volume = {21},
number = {7},
pages = {747--765},
year = {1991},
url = {https://doi.org/10.1002/net.3230210704},
doi = {10.1002/NET.3230210704},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RussellG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SheraliR91,
author = {Hanif D. Sherali and
Thomas P. Rizzo},
title = {Unbalanced, capacitated \emph{p}-median problems on a chain graph
with a continuum of link demands},
journal = {Networks},
volume = {21},
number = {2},
pages = {133--163},
year = {1991},
url = {https://doi.org/10.1002/net.3230210202},
doi = {10.1002/NET.3230210202},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SheraliR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SidneySW91,
author = {Jeffrey B. Sidney and
Stuart J. Sidney and
Art Warburton},
title = {Average properties of two-dimensional partial orders},
journal = {Networks},
volume = {21},
number = {5},
pages = {487--503},
year = {1991},
url = {https://doi.org/10.1002/net.3230210502},
doi = {10.1002/NET.3230210502},
timestamp = {Sun, 08 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SidneySW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Strickland91,
author = {Stephen G. Strickland},
title = {Stochastic modeling and the theory of queues, by R. W. WOE, Rentice
Hall, Engle- wood Cliffs, NJ, 1989, 556 pp},
journal = {Networks},
volume = {21},
number = {3},
pages = {371},
year = {1991},
url = {https://doi.org/10.1002/net.3230210309},
doi = {10.1002/NET.3230210309},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Strickland91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Tzvieli91,
author = {Dvora Tzvieli},
title = {Minimal diameter double-loop networks. I. Large infinite optimal families},
journal = {Networks},
volume = {21},
number = {4},
pages = {387--415},
year = {1991},
url = {https://doi.org/10.1002/net.3230210403},
doi = {10.1002/NET.3230210403},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Tzvieli91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ulrich91,
author = {Gary Ulrich},
title = {Simulation methodology for statisticians, operations analysts and
engineers, Vol. I, by P. A. W. Lewis and E. J. Orav, Wadsworth, Belmont,
CA, 1989, 416 pp},
journal = {Networks},
volume = {21},
number = {3},
pages = {369--370},
year = {1991},
url = {https://doi.org/10.1002/net.3230210308},
doi = {10.1002/NET.3230210308},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ulrich91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ventura91,
author = {Jos{\'{e}} A. Ventura},
title = {Computational development of a lagrangian dual approach for quadratic
networks},
journal = {Networks},
volume = {21},
number = {4},
pages = {469--485},
year = {1991},
url = {https://doi.org/10.1002/net.3230210407},
doi = {10.1002/NET.3230210407},
timestamp = {Sun, 22 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ventura91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/YangJ91,
author = {Chengen Yang and
Dayong Jin},
title = {A primal-dual algorithm for the minimum average weighted length circuit
problem},
journal = {Networks},
volume = {21},
number = {7},
pages = {705--712},
year = {1991},
url = {https://doi.org/10.1002/net.3230210702},
doi = {10.1002/NET.3230210702},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/YangJ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/YoungTO91,
author = {Neal E. Young and
Robert Endre Tarjan and
James B. Orlin},
title = {Faster parametric shortest path and minimum-balance algorithms},
journal = {Networks},
volume = {21},
number = {2},
pages = {205--221},
year = {1991},
url = {https://doi.org/10.1002/net.3230210206},
doi = {10.1002/NET.3230210206},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/YoungTO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2025-01-05 13:18 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
