default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/networks/networks22.bht:"
download as .bib file
@article{DBLP:journals/networks/AkincS92,
author = {Umit Akinc and
Kizhanatham Srikanth},
title = {Optimal routing and process scheduling for a mobile service facility},
journal = {Networks},
volume = {22},
number = {2},
pages = {163--183},
year = {1992},
url = {https://doi.org/10.1002/net.3230220204},
doi = {10.1002/NET.3230220204},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AkincS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AnilyH92,
author = {Shoshana Anily and
Refael Hassin},
title = {The swapping problem},
journal = {Networks},
volume = {22},
number = {4},
pages = {419--433},
year = {1992},
url = {https://doi.org/10.1002/net.3230220408},
doi = {10.1002/NET.3230220408},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AnilyH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BagchiSH92,
author = {Anindo Bagchi and
Edward F. Schmeichel and
S. Louis Hakimi},
title = {Sequential information dissemination by packets},
journal = {Networks},
volume = {22},
number = {4},
pages = {317--333},
year = {1992},
url = {https://doi.org/10.1002/net.3230220402},
doi = {10.1002/NET.3230220402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BagchiSH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ben-NatanB92,
author = {Ron Ben{-}Natan and
Amnon Barak},
title = {Parallel contractions of grids for task assignment to processor networks},
journal = {Networks},
volume = {22},
number = {6},
pages = {539--562},
year = {1992},
url = {https://doi.org/10.1002/net.3230220605},
doi = {10.1002/NET.3230220605},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ben-NatanB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BenaventCCM92,
author = {Enrique Benavent and
Vicente Campos and
Angel Corber{\'{a}}n and
Enrique Mota},
title = {The Capacitated Arc Routing Problem: Lower bounds},
journal = {Networks},
volume = {22},
number = {7},
pages = {669--690},
year = {1992},
url = {https://doi.org/10.1002/net.3230220706},
doi = {10.1002/NET.3230220706},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BenaventCCM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Boyd92,
author = {E. Andrew Boyd},
title = {A pseudopolynomial network flow formulation for exact knapsack separation},
journal = {Networks},
volume = {22},
number = {5},
pages = {503--514},
year = {1992},
url = {https://doi.org/10.1002/net.3230220507},
doi = {10.1002/NET.3230220507},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Boyd92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Cheng92,
author = {Chung{-}Kuan Cheng},
title = {The optimal partitioning of networks},
journal = {Networks},
volume = {22},
number = {3},
pages = {297--315},
year = {1992},
url = {https://doi.org/10.1002/net.3230220307},
doi = {10.1002/NET.3230220307},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Cheng92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChoiE92,
author = {Hyeong{-}Ah Choi and
Abdol{-}Hossein Esfahanian},
title = {A message-routing strategy for multicomputer systems},
journal = {Networks},
volume = {22},
number = {7},
pages = {627--646},
year = {1992},
url = {https://doi.org/10.1002/net.3230220703},
doi = {10.1002/NET.3230220703},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChoiE92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CoffmanG92,
author = {Edward G. Coffman Jr. and
Edgar N. Gilbert},
title = {Paths through a maze of rectangles},
journal = {Networks},
volume = {22},
number = {4},
pages = {349--367},
year = {1992},
url = {https://doi.org/10.1002/net.3230220404},
doi = {10.1002/NET.3230220404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CoffmanG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CsabaFGLS92,
author = {L{\'{a}}szl{\'{o}} Csaba and
Ralph J. Faudree and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Networks communicating for each pairing of terminals},
journal = {Networks},
volume = {22},
number = {7},
pages = {615--626},
year = {1992},
url = {https://doi.org/10.1002/net.3230220702},
doi = {10.1002/NET.3230220702},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CsabaFGLS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EiseltGL92,
author = {Horst A. Eiselt and
Michel Gendreau and
Gilbert Laporte},
title = {Location of facilities on a network subject to a single-edge failure},
journal = {Networks},
volume = {22},
number = {3},
pages = {231--246},
year = {1992},
url = {https://doi.org/10.1002/net.3230220303},
doi = {10.1002/NET.3230220303},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EiseltGL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Elmallah92,
author = {Ehab S. Elmallah},
title = {Algorithms for K-terminal reliability problems with node failures},
journal = {Networks},
volume = {22},
number = {4},
pages = {369--384},
year = {1992},
url = {https://doi.org/10.1002/net.3230220405},
doi = {10.1002/NET.3230220405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Elmallah92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ElmallahC92,
author = {Ehab S. Elmallah and
Charles J. Colbourn},
title = {Series-parallel subgraphs of planar graphs},
journal = {Networks},
volume = {22},
number = {6},
pages = {607--614},
year = {1992},
url = {https://doi.org/10.1002/net.3230220608},
doi = {10.1002/NET.3230220608},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ElmallahC92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ErkutFT92,
author = {Erhan Erkut and
Richard L. Francis and
Arie Tamir},
title = {Distance-constrained multifacility minimax location problems on tree
networks},
journal = {Networks},
volume = {22},
number = {1},
pages = {37--54},
year = {1992},
url = {https://doi.org/10.1002/net.3230220104},
doi = {10.1002/NET.3230220104},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ErkutFT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EtzionB92,
author = {Tuvi Etzion and
Israel Bar{-}David},
title = {An explicit construction of Euler circuits in shuffle nets and related
networks},
journal = {Networks},
volume = {22},
number = {6},
pages = {523--529},
year = {1992},
url = {https://doi.org/10.1002/net.3230220603},
doi = {10.1002/NET.3230220603},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EtzionB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FukudaM92,
author = {Komei Fukuda and
Tomomi Matsui},
title = {Finding all minimum-cost perfect matchings in Bipartite graphs},
journal = {Networks},
volume = {22},
number = {5},
pages = {461--468},
year = {1992},
url = {https://doi.org/10.1002/net.3230220504},
doi = {10.1002/NET.3230220504},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FukudaM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Gargano92,
author = {Luisa Gargano},
title = {Tighter time bounds on fault-tolerant broadcasting and gossiping},
journal = {Networks},
volume = {22},
number = {5},
pages = {469--486},
year = {1992},
url = {https://doi.org/10.1002/net.3230220505},
doi = {10.1002/NET.3230220505},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Gargano92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HamburgerPW92,
author = {Peter Hamburger and
Raymond E. Pippert and
William Douglas Weakley},
title = {On a leverage problem in the hypercube},
journal = {Networks},
volume = {22},
number = {5},
pages = {435--439},
year = {1992},
url = {https://doi.org/10.1002/net.3230220502},
doi = {10.1002/NET.3230220502},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HamburgerPW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HuH92,
author = {Xiao{-}Dong Hu and
Frank Kwang{-}Ming Hwang},
title = {Reliabilities of chordal rings},
journal = {Networks},
volume = {22},
number = {5},
pages = {487--501},
year = {1992},
url = {https://doi.org/10.1002/net.3230220506},
doi = {10.1002/NET.3230220506},
timestamp = {Tue, 10 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/HuH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HwangR92,
author = {Frank K. Hwang and
Dana S. Richards},
title = {Steiner tree problems},
journal = {Networks},
volume = {22},
number = {1},
pages = {55--89},
year = {1992},
url = {https://doi.org/10.1002/net.3230220105},
doi = {10.1002/NET.3230220105},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HwangR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Jaillet92,
author = {Patrick Jaillet},
title = {Shortest path problems with node failures},
journal = {Networks},
volume = {22},
number = {6},
pages = {589--605},
year = {1992},
url = {https://doi.org/10.1002/net.3230220607},
doi = {10.1002/NET.3230220607},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Jaillet92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KellyGA92,
author = {James P. Kelly and
Bruce L. Golden and
Arjang A. Assad},
title = {Cell suppression: Disclosure protection for sensitive tabular data},
journal = {Networks},
volume = {22},
number = {4},
pages = {397--417},
year = {1992},
url = {https://doi.org/10.1002/net.3230220407},
doi = {10.1002/NET.3230220407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KellyGA92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LiMS92,
author = {Chung{-}Lun Li and
S. Thomas McCormick and
David Simchi{-}Levi},
title = {Finding disjoint paths with different path-costs: Complexity and algorithms},
journal = {Networks},
volume = {22},
number = {7},
pages = {653--667},
year = {1992},
url = {https://doi.org/10.1002/net.3230220705},
doi = {10.1002/NET.3230220705},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/LiMS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MillerP92,
author = {Zevi Miller and
Manley Perkel},
title = {The steiner problem in the hypercube},
journal = {Networks},
volume = {22},
number = {1},
pages = {1--19},
year = {1992},
url = {https://doi.org/10.1002/net.3230220102},
doi = {10.1002/NET.3230220102},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MillerP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Myrvold92,
author = {Wendy J. Myrvold},
title = {Counting \emph{k}-component forests of a graph},
journal = {Networks},
volume = {22},
number = {7},
pages = {647--652},
year = {1992},
url = {https://doi.org/10.1002/net.3230220704},
doi = {10.1002/NET.3230220704},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Myrvold92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NagurneyH92,
author = {Anna Nagurney and
Merritt Hughes},
title = {Financial flow of funds networks},
journal = {Networks},
volume = {22},
number = {2},
pages = {145--161},
year = {1992},
url = {https://doi.org/10.1002/net.3230220203},
doi = {10.1002/NET.3230220203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/NagurneyH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Pelc92,
author = {Andrzej Pelc},
title = {Reliable communication in networks with Byzantine link failures},
journal = {Networks},
volume = {22},
number = {5},
pages = {441--459},
year = {1992},
url = {https://doi.org/10.1002/net.3230220503},
doi = {10.1002/NET.3230220503},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Pelc92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Polak92,
author = {George G. Polak},
title = {On a parametric shortest path problem from primal - dual multicommodity
network optimization},
journal = {Networks},
volume = {22},
number = {3},
pages = {283--295},
year = {1992},
url = {https://doi.org/10.1002/net.3230220306},
doi = {10.1002/NET.3230220306},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Polak92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Prisner92,
author = {Erich Prisner},
title = {Two algorithms for the subset interconnection design problem},
journal = {Networks},
volume = {22},
number = {4},
pages = {385--395},
year = {1992},
url = {https://doi.org/10.1002/net.3230220406},
doi = {10.1002/NET.3230220406},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Prisner92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RabinovitchT92,
author = {Ramon Rabinovitch and
Arie Tamir},
title = {On a tree-shaped facility location problem of Minieka},
journal = {Networks},
volume = {22},
number = {6},
pages = {515--522},
year = {1992},
url = {https://doi.org/10.1002/net.3230220602},
doi = {10.1002/NET.3230220602},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RabinovitchT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RaviMR92,
author = {R. Ravi and
Madhav V. Marathe and
C. Pandu Rangan},
title = {An optimal algorithm to solve the all-pair shortest path problem on
interval graphs},
journal = {Networks},
volume = {22},
number = {1},
pages = {21--35},
year = {1992},
url = {https://doi.org/10.1002/net.3230220103},
doi = {10.1002/NET.3230220103},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RaviMR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Rivera-VegaVN92,
author = {Pedro I. Rivera{-}Vega and
Ravi Varadarajan and
Shamkant B. Navathe},
title = {Scheduling file transfers in fully connected networks},
journal = {Networks},
volume = {22},
number = {6},
pages = {563--588},
year = {1992},
url = {https://doi.org/10.1002/net.3230220606},
doi = {10.1002/NET.3230220606},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Rivera-VegaVN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RobertsX92,
author = {Fred S. Roberts and
Yonghua Xu},
title = {On the optimal strongly connected orientations of city street graphs.
{III.} Three east-west avenues or north-south streets},
journal = {Networks},
volume = {22},
number = {2},
pages = {109--143},
year = {1992},
url = {https://doi.org/10.1002/net.3230220202},
doi = {10.1002/NET.3230220202},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/RobertsX92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Rote92,
author = {G{\"{u}}nter Rote},
title = {The n-line traveling salesman problem},
journal = {Networks},
volume = {22},
number = {1},
pages = {91--108},
year = {1992},
url = {https://doi.org/10.1002/net.3230220106},
doi = {10.1002/NET.3230220106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Rote92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RubinsteinTW92,
author = {J. Hyam Rubinstein and
Doreen A. Thomas and
Jia F. Weng},
title = {Degree-five Steiner points cannot reduce network costs for planar
sets},
journal = {Networks},
volume = {22},
number = {6},
pages = {531--537},
year = {1992},
url = {https://doi.org/10.1002/net.3230220604},
doi = {10.1002/NET.3230220604},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RubinsteinTW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SankaranarayanaS92,
author = {Ramesh S. Sankaranarayana and
Lorna K. Stewart},
title = {Complexity results for well-covered graphs},
journal = {Networks},
volume = {22},
number = {3},
pages = {247--262},
year = {1992},
url = {https://doi.org/10.1002/net.3230220304},
doi = {10.1002/NET.3230220304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SankaranarayanaS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SatyanarayanaSS92,
author = {Appajosyula Satyanarayana and
L. Schoppmann and
Charles L. Suffel},
title = {A reliability-improving graph transformation with applications to
network reliability},
journal = {Networks},
volume = {22},
number = {2},
pages = {209--216},
year = {1992},
url = {https://doi.org/10.1002/net.3230220206},
doi = {10.1002/NET.3230220206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SatyanarayanaSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ShapiroWN92,
author = {Jacob Shapiro and
Jerry Waxman and
Danny Nir},
title = {Level graphs and approximate shortest path algorithms},
journal = {Networks},
volume = {22},
number = {7},
pages = {691--717},
year = {1992},
url = {https://doi.org/10.1002/net.3230220707},
doi = {10.1002/NET.3230220707},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ShapiroWN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/TamirL92,
author = {Arie Tamir and
Timothy J. Lowe},
title = {The generalized \emph{P}-forest problem on a tree network},
journal = {Networks},
volume = {22},
number = {3},
pages = {217--230},
year = {1992},
url = {https://doi.org/10.1002/net.3230220302},
doi = {10.1002/NET.3230220302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/TamirL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Tsitsiklis92,
author = {John N. Tsitsiklis},
title = {Special cases of traveling salesman and repairman problems with time
windows},
journal = {Networks},
volume = {22},
number = {3},
pages = {263--282},
year = {1992},
url = {https://doi.org/10.1002/net.3230220305},
doi = {10.1002/NET.3230220305},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Tsitsiklis92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Weng92,
author = {J. F. Weng},
title = {Degenerate Gilbert - Steiner trees},
journal = {Networks},
volume = {22},
number = {4},
pages = {335--348},
year = {1992},
url = {https://doi.org/10.1002/net.3230220403},
doi = {10.1002/NET.3230220403},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Weng92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/YeeL92,
author = {James R. Yee and
Frank Yeong{-}Sung Lin},
title = {A routing algorithm for virtual circuit data networks with multiple
sessions per {O} - {D} pair},
journal = {Networks},
volume = {22},
number = {2},
pages = {185--208},
year = {1992},
url = {https://doi.org/10.1002/net.3230220205},
doi = {10.1002/NET.3230220205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/YeeL92.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 2024-10-02 23:53 CEST 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:
