Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Networks AND Volume=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognizing triangle-free graphs with induced path-cycle double covers is
NP
-complete
Michael S. Jacobson
,
André E. Kézdy
,
Jenŏ Lehel
Networks
31
(1), 1998, pp. 1-10
A strong lower bound for the node weighted Steiner tree problem
Stefan Engevall
,
Maud Göthe-Lundgren
,
Peter Värbrand
Networks
31
(1), 1998, pp. 11-17
On capacitated stochastic chain problems in a network
L. Ganapathy
,
K.P.K. Nair
Networks
31
(1), 1998, pp. 19-27
Tough enough chordal graphs are Hamiltonian
Guantao Chen
,
Michael S. Jacobson
,
André E. Kézdy
,
Jenŏ Lehel
Networks
31
(1), 1998, pp. 29-38
A branch and cut algorithm for the Steiner Problem in graphs
A. Lucena
,
J.E. Beasley
Networks
31
(1), 1998, pp. 39-59
Reliability analysis of circulant graphs
Qiaoliang Li
,
Qiao Li
Networks
31
(2), 1998, pp. 61-65
Fast collective communication by packets in the postal model
Luisa Gargano
,
Adele A. Rescigno
Networks
31
(2), 1998, pp. 67-79
Location problems with grouped structure of demand: Complexity and algorithms
Igor Averbakh
,
Oded Berman
Networks
31
(2), 1998, pp. 81-92
Minmax-regret robust 1-median location on a tree
Bintong Chen
,
Chin-Shien Lin
Networks
31
(2), 1998, pp. 93-103
Topological properties and algorithms for two-level hypernet networks
Hui-Ling Huang
,
Gen-Huey Chen
Networks
31
(2), 1998, pp. 105-118
Process network synthesis: Problem definition
F. Friedler
,
L.T. Fan
,
B. Imreh
Networks
31
(2), 1998, pp. 119-124
Tools for studying paths and cycles in digraphs
C. Delorme
,
O. Ordaz
,
D. Quiroz
Networks
31
(2), 1998, pp. 125-148
Flow-dependent networks: Existence and behavior at Steiner points
Christopher L. Cox
Networks
31
(3), 1998, pp. 149-156
Edge connectivity between nodes and node-subsets
Hiro Ito
,
Mitsuo Yokoyama
Networks
31
(3), 1998, pp. 157-163
Feasibility in transportation networks with supply eating arcs
Shane Dye
,
Asgeir Tomasgard
,
Stein W. Wallace
Networks
31
(3), 1998, pp. 165-176
A linear-time algorithm for connected
r
-domination and Steiner tree on distance-hereditary graphs
Andreas Brandstädt
,
Feodor F. Dragan
Networks
31
(3), 1998, pp. 177-182
Verification of DAG structures in cooperative belief network-based multiagent systems
Y. Xiang
Networks
31
(3), 1998, pp. 183-191
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
Irina Ioachim
,
Sylvie Gélinas
,
François Soumis
,
Jacques Desrosiers
Networks
31
(3), 1998, pp. 193-204
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
Dong X. Shaw
,
Geon Cho
Networks
31
(3), 1998, pp. 205-216
Uniformly optimally reliable graphs
D. Gross
,
J.T. Saccoman
Networks
31
(3), 1998, pp. 217-225
A new proximal decomposition algorithm for routing in telecommunication networks
P. Mahey
,
A. Ouorou
,
L. LeBlanc
,
J. Chifflet
Networks
31
(4), 1998, pp. 227-238
Undirected graphs rearrangeable by 2-length walks
Dominique Barth
,
Petrişor Panaite
Networks
31
(4), 1998, pp. 239-247
Solving the all-pair shortest path query problem on interval and circular-arc graphs
Danny Z. Chen
,
D.T. Lee
,
R. Sridhar
,
Chandra N. Sekharan
Networks
31
(4), 1998, pp. 249-257
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
Hanif D. Sherali
,
Kaan Ozbay
,
Shrivaram Subramanian
Networks
31
(4), 1998, pp. 259-272
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
Uwe H. Suhl
,
Heinrich Hilbert
Networks
31
(4), 1998, pp. 273-282
Seiten 1
2
>