Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/networks/networks11.bht:"
download as .bib file
@article{DBLP:journals/networks/AkiyamaBEHT81,
author = {Jin Akiyama and
Frank Boesch and
Hiroshi Era and
Frank Harary and
Ralph Tindell},
title = {The cohesiveness of a point of a graph},
journal = {Networks},
volume = {11},
number = {1},
pages = {65--68},
year = {1981},
url = {https://doi.org/10.1002/net.3230110107},
doi = {10.1002/NET.3230110107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AkiyamaBEHT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AkiyamaEH81,
author = {Jin Akiyama and
Geoffrey Exoo and
Frank Harary},
title = {Covering and packing in graphs {IV:} Linear arboricity},
journal = {Networks},
volume = {11},
number = {1},
pages = {69--72},
year = {1981},
url = {https://doi.org/10.1002/net.3230110108},
doi = {10.1002/NET.3230110108},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/AkiyamaEH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Anderson81,
author = {Edward J. Anderson},
title = {Mazes: Search games on unknown networks},
journal = {Networks},
volume = {11},
number = {4},
pages = {393--397},
year = {1981},
url = {https://doi.org/10.1002/net.3230110409},
doi = {10.1002/NET.3230110409},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Anderson81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BallM81,
author = {Michael O. Ball and
Michael J. Magazine},
title = {The design and analysis of heuristics},
journal = {Networks},
volume = {11},
number = {2},
pages = {215--219},
year = {1981},
url = {https://doi.org/10.1002/net.3230110210},
doi = {10.1002/NET.3230110210},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BallM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BodinG81,
author = {Lawrence Bodin and
Bruce L. Golden},
title = {Classification in vehicle routing and scheduling},
journal = {Networks},
volume = {11},
number = {2},
pages = {97--108},
year = {1981},
url = {https://doi.org/10.1002/net.3230110204},
doi = {10.1002/NET.3230110204},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BodinG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Boesch81,
author = {Frank Boesch},
title = {Editorial},
journal = {Networks},
volume = {11},
number = {2},
pages = {93},
year = {1981},
url = {https://doi.org/10.1002/net.3230110202},
doi = {10.1002/NET.3230110202},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Boesch81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoeschHK81,
author = {Frank Boesch and
Frank Harary and
Jerald A. Kabell},
title = {Graphs as models of communication network vulnerability: Connectivity
and persistence},
journal = {Networks},
volume = {11},
number = {1},
pages = {57--63},
year = {1981},
url = {https://doi.org/10.1002/net.3230110106},
doi = {10.1002/NET.3230110106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoeschHK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChristofidesMT81,
author = {Nicos Christofides and
Aristide Mingozzi and
Paolo Toth},
title = {State-space relaxation procedures for the computation of bounds to
routing problems},
journal = {Networks},
volume = {11},
number = {2},
pages = {145--164},
year = {1981},
url = {https://doi.org/10.1002/net.3230110207},
doi = {10.1002/NET.3230110207},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChristofidesMT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Colbourn81,
author = {Charles J. Colbourn},
title = {On testing isomorphism of permutation graphs},
journal = {Networks},
volume = {11},
number = {1},
pages = {13--21},
year = {1981},
url = {https://doi.org/10.1002/net.3230110103},
doi = {10.1002/NET.3230110103},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Colbourn81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CullenJR81,
author = {Frank H. Cullen and
John J. Jarvis and
H. Donald Ratliff},
title = {Set partitioning based heuristics for interactive routing},
journal = {Networks},
volume = {11},
number = {2},
pages = {125--143},
year = {1981},
url = {https://doi.org/10.1002/net.3230110206},
doi = {10.1002/NET.3230110206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CullenJR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Derigs81,
author = {Ulrich Derigs},
title = {A shortest augmenting path method for solving minimal perfect matching
problems},
journal = {Networks},
volume = {11},
number = {4},
pages = {379--390},
year = {1981},
url = {https://doi.org/10.1002/net.3230110407},
doi = {10.1002/NET.3230110407},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Derigs81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Discenza81,
author = {Joseph H. Discenza},
title = {A more compact formulation of the symmetric multiple traveling salesman
problem with fixed charges},
journal = {Networks},
volume = {11},
number = {1},
pages = {73--75},
year = {1981},
url = {https://doi.org/10.1002/net.3230110109},
doi = {10.1002/NET.3230110109},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Discenza81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Farley81,
author = {Arthur M. Farley},
title = {Networks immune to isolated failures},
journal = {Networks},
volume = {11},
number = {3},
pages = {255--268},
year = {1981},
url = {https://doi.org/10.1002/net.3230110304},
doi = {10.1002/NET.3230110304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Farley81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FisherJ81,
author = {Marshall L. Fisher and
Ramchandran Jaikumar},
title = {A generalized assignment heuristic for vehicle routing},
journal = {Networks},
volume = {11},
number = {2},
pages = {109--124},
year = {1981},
url = {https://doi.org/10.1002/net.3230110205},
doi = {10.1002/NET.3230110205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FisherJ81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FlorianNP81,
author = {Michael Florian and
Sang Nguyen and
Stefano Pallottino},
title = {A dual simplex algorithm for finding all shortest paths},
journal = {Networks},
volume = {11},
number = {4},
pages = {367--378},
year = {1981},
url = {https://doi.org/10.1002/net.3230110406},
doi = {10.1002/NET.3230110406},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FlorianNP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Fujishige81,
author = {Satoru Fujishige},
title = {A note on the problem of updating shortest paths},
journal = {Networks},
volume = {11},
number = {3},
pages = {317--319},
year = {1981},
url = {https://doi.org/10.1002/net.3230110309},
doi = {10.1002/NET.3230110309},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Fujishige81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldenB81,
author = {Bruce L. Golden and
Lawrence D. Bodin},
title = {Preface},
journal = {Networks},
volume = {11},
number = {2},
pages = {95--96},
year = {1981},
url = {https://doi.org/10.1002/net.3230110203},
doi = {10.1002/NET.3230110203},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldenB81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoldenW81,
author = {Bruce L. Golden and
Richard T. Wong},
title = {Capacitated arc routing problems},
journal = {Networks},
volume = {11},
number = {3},
pages = {305--315},
year = {1981},
url = {https://doi.org/10.1002/net.3230110308},
doi = {10.1002/NET.3230110308},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoldenW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hassin81,
author = {Refael Hassin},
title = {Generalizations of Hoffman's existence theorem for circulations},
journal = {Networks},
volume = {11},
number = {3},
pages = {243--254},
year = {1981},
url = {https://doi.org/10.1002/net.3230110303},
doi = {10.1002/NET.3230110303},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hassin81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Kershenbaum81,
author = {Aaron Kershenbaum},
title = {A note on finding shortest path trees},
journal = {Networks},
volume = {11},
number = {4},
pages = {399--400},
year = {1981},
url = {https://doi.org/10.1002/net.3230110410},
doi = {10.1002/NET.3230110410},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Kershenbaum81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LampreyB81,
author = {Roger H. Lamprey and
Bruce H. Barnes},
title = {A new concept of primeness in graphs},
journal = {Networks},
volume = {11},
number = {3},
pages = {279--284},
year = {1981},
url = {https://doi.org/10.1002/net.3230110306},
doi = {10.1002/NET.3230110306},
timestamp = {Sun, 10 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LampreyB81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LarsonL81,
author = {Richard C. Larson and
Victor O. K. Li},
title = {Finding minimum rectilinear distance paths in the presence of barriers},
journal = {Networks},
volume = {11},
number = {3},
pages = {285--304},
year = {1981},
url = {https://doi.org/10.1002/net.3230110307},
doi = {10.1002/NET.3230110307},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LarsonL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LenstraK81,
author = {Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Complexity of vehicle routing and scheduling problems},
journal = {Networks},
volume = {11},
number = {2},
pages = {221--227},
year = {1981},
url = {https://doi.org/10.1002/net.3230110211},
doi = {10.1002/NET.3230110211},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/LenstraK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Magnanti81,
author = {Thomas L. Magnanti},
title = {Combinatorial optimization and vehicle fleet planning: Perspectives
and prospects},
journal = {Networks},
volume = {11},
number = {2},
pages = {179--213},
year = {1981},
url = {https://doi.org/10.1002/net.3230110209},
doi = {10.1002/NET.3230110209},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Magnanti81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MarstenS81,
author = {Roy E. Marsten and
Fred Shepardson},
title = {Exact solution of crew scheduling problems using the set partitioning
model: Recent successful applications},
journal = {Networks},
volume = {11},
number = {2},
pages = {165--177},
year = {1981},
url = {https://doi.org/10.1002/net.3230110208},
doi = {10.1002/NET.3230110208},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MarstenS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Minieka81,
author = {Edward Minieka},
title = {A polynomial time algorithm for finding the absolute center of a network},
journal = {Networks},
volume = {11},
number = {4},
pages = {351--355},
year = {1981},
url = {https://doi.org/10.1002/net.3230110404},
doi = {10.1002/NET.3230110404},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Minieka81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Monma81,
author = {Clyde L. Monma},
title = {Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel
Dekker, New York, 1979, 648 pp. Price {\textdollar}39.75},
journal = {Networks},
volume = {11},
number = {3},
pages = {321--322},
year = {1981},
url = {https://doi.org/10.1002/net.3230110310},
doi = {10.1002/NET.3230110310},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Monma81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MossM81,
author = {Franklin H. Moss and
Philip M. Merlin},
title = {Some theoretical results in multiple path definition in networks},
journal = {Networks},
volume = {11},
number = {4},
pages = {401--411},
year = {1981},
url = {https://doi.org/10.1002/net.3230110411},
doi = {10.1002/NET.3230110411},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MossM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PerlY81,
author = {Yehoshua Perl and
Yaacov Yesha},
title = {Mean flow scheduling and optimal construction of a treelike communication
network},
journal = {Networks},
volume = {11},
number = {1},
pages = {87--92},
year = {1981},
url = {https://doi.org/10.1002/net.3230110111},
doi = {10.1002/NET.3230110111},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PerlY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Plesnik81,
author = {J{\'{a}}n Plesn{\'{\i}}k},
title = {The complexity of designing a network with minimum diameter},
journal = {Networks},
volume = {11},
number = {1},
pages = {77--85},
year = {1981},
url = {https://doi.org/10.1002/net.3230110110},
doi = {10.1002/NET.3230110110},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Plesnik81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Rosenthal81,
author = {Arnon Rosenthal},
title = {Series-parallel reduction for difficult measures of network reliability},
journal = {Networks},
volume = {11},
number = {4},
pages = {323--334},
year = {1981},
url = {https://doi.org/10.1002/net.3230110402},
doi = {10.1002/NET.3230110402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Rosenthal81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RotemU81,
author = {Doron Rotem and
Jorge Urrutia},
title = {Finding maximum cliques in circle graphs},
journal = {Networks},
volume = {11},
number = {3},
pages = {269--278},
year = {1981},
url = {https://doi.org/10.1002/net.3230110305},
doi = {10.1002/NET.3230110305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RotemU81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RyanC81,
author = {Doris R. Ryan and
Stephen Chen},
title = {A comparison of three algorithms for finding fundamental cycles in
a directed graph},
journal = {Networks},
volume = {11},
number = {1},
pages = {1--12},
year = {1981},
url = {https://doi.org/10.1002/net.3230110102},
doi = {10.1002/NET.3230110102},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RyanC81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SatyanarayanaH81,
author = {A. Satyanarayana and
Jane N. Hagstrom},
title = {Combinatorial properties of directed graphs useful in computing network
reliability},
journal = {Networks},
volume = {11},
number = {4},
pages = {357--366},
year = {1981},
url = {https://doi.org/10.1002/net.3230110405},
doi = {10.1002/NET.3230110405},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SatyanarayanaH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Schrage81,
author = {Linus Schrage},
title = {Formulation and structure of more complex/realistic routing and scheduling
problems},
journal = {Networks},
volume = {11},
number = {2},
pages = {229--232},
year = {1981},
url = {https://doi.org/10.1002/net.3230110212},
doi = {10.1002/NET.3230110212},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Schrage81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Slater81,
author = {Peter J. Slater},
title = {The \emph{k}-nucleus of a graph},
journal = {Networks},
volume = {11},
number = {3},
pages = {233--242},
year = {1981},
url = {https://doi.org/10.1002/net.3230110302},
doi = {10.1002/NET.3230110302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Slater81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SmithLL81,
author = {J. MacGregor Smith and
D. T. Lee and
Judith Liebman},
title = {An O(\emph{n} log \emph{n}) heuristic for steiner minimal tree problems
on the euclidean metric},
journal = {Networks},
volume = {11},
number = {1},
pages = {23--39},
year = {1981},
url = {https://doi.org/10.1002/net.3230110104},
doi = {10.1002/NET.3230110104},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SmithLL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SmolleckC81,
author = {Howard A. Smolleck and
Mo{-}Shing Chen},
title = {A new approach to near-optimal path assignment through electric-circuit
modeling},
journal = {Networks},
volume = {11},
number = {4},
pages = {335--349},
year = {1981},
url = {https://doi.org/10.1002/net.3230110403},
doi = {10.1002/NET.3230110403},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SmolleckC81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Weber81,
author = {G. M. Weber},
title = {Sensitivity analysis of optimal matchings},
journal = {Networks},
volume = {11},
number = {1},
pages = {41--56},
year = {1981},
url = {https://doi.org/10.1002/net.3230110105},
doi = {10.1002/NET.3230110105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Weber81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Zadeh81,
author = {Norman Zadeh},
title = {On the elimination of negative cost arcs in flow problems},
journal = {Networks},
volume = {11},
number = {4},
pages = {391--392},
year = {1981},
url = {https://doi.org/10.1002/net.3230110408},
doi = {10.1002/NET.3230110408},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Zadeh81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-07-10 17:38 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:
