UB Paderborn / Katalog / Suche / in CDI

The complexity of searching a graph

Journal of the ACM, 1988, Vol.35 (1), p.18-44

1988

Volltextzugriff (PDF)

Sufficient degree conditions for k-edge-connectedness of a graph

Networks, 2009-09, Vol.54 (2), p.95-98

2009

Volltextzugriff (PDF)

On locating path- or tree-shaped facilities on networks

Networks, 1993-09, Vol.23 (6), p.543-555

1993

Volltextzugriff (PDF)

Recognizing tough graphs is NP-hard

Discrete Applied Mathematics, 1990-09, Vol.28 (3), p.191-195

1990

Volltextzugriff (PDF)

Information dissemination in distributed systems with faulty units

IEEE transactions on computers, 1994-06, Vol.43 (6), p.698-710

1994

Volltextzugriff (PDF)

Parallel information dissemination by packets

SIAM journal on computing, 1994-04, Vol.23 (2), p.355-372

1994

Volltextzugriff (PDF)

Gossiping in a distributed network

IEEE transactions on computers, 1993-02, Vol.42 (2), p.253-256

1993

Volltextzugriff (PDF)

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

Operations research, 1964-06, Vol.12 (3), p.450-459

Hakimi, S. L

1964

Volltextzugriff (PDF)

Parallel algorithms for gossiping by mail

Information processing letters, 1990-04, Vol.34 (4), p.197-202

1990

Volltextzugriff (PDF)

Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

Operations research, 1965-06, Vol.13 (3), p.462-475

Hakimi, S. L

1965

Volltextzugriff (PDF)

On Adaptive System Diagnosis

IEEE transactions on computers, 1984-03, Vol.C-33 (3), p.234-240

1984

Volltextzugriff (PDF)

On computing a conditional edge-connectivity of a graph

Information processing letters, 1988-04, Vol.27 (4), p.195-199

1988

Volltextzugriff (PDF)

A cycle structure theorem for hamiltonian graphs

Journal of combinatorial theory. Series B, 1988-08, Vol.45 (1), p.99-107

1988

Volltextzugriff (PDF)

Sequential information dissemination by packets

Networks, 1992-07, Vol.22 (4), p.317-333

1992

Volltextzugriff (PDF)

On minimum fault-tolerant networks

SIAM journal on discrete mathematics, 1993-11, Vol.6 (4), p.565-574

1993

Volltextzugriff (PDF)

Star arboricity of graphs

Discrete mathematics, 1996-02, Vol.149 (1), p.93-98

1996

Volltextzugriff (PDF)

Distributed diagnosis and the system user

IEEE transactions on computers, 1988-01, Vol.37 (1), p.71-78

1988

Volltextzugriff (PDF)

Orienting graphs to optimize reachability

Information processing letters, 1997-09, Vol.63 (5), p.229-235

1997

Volltextzugriff (PDF)

Locations on time-varying networks

Networks, 1999-12, Vol.34 (4), p.250-257

1999

Volltextzugriff (PDF)

Optimum Locations of Centers in Networks

Operations research, 1972-09, Vol.20 (5), p.967-973

1972

Volltextzugriff (PDF)

A parallel fault identification algorithm

Journal of algorithms, 1990-06, Vol.11 (2), p.231-241

1990

Volltextzugriff (PDF)

Locating replicas of a database on a network

Networks, 1997-08, Vol.30 (1), p.31-36

1997

Volltextzugriff (PDF)

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness

Journal of the Society for Industrial and Applied Mathematics, 1963-03, Vol.11 (1), p.135-147

Hakimi, S. L.

1963

Volltextzugriff (PDF)

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

Journal of the Society for Industrial and Applied Mathematics, 1962-09, Vol.10 (3), p.496-506

Hakimi, S. L.

1962

Volltextzugriff (PDF)

A Graph-Theoretic Approach to a Class of Integer-Programming Problems

Operations research, 1969-11, Vol.17 (6), p.1017-1033

1969

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

The complexity of searching a graph

Sufficient degree conditions for k-edge-connectedness of a graph

On locating path- or tree-shaped facilities on networks

Recognizing tough graphs is NP-hard

Information dissemination in distributed systems with faulty units

Parallel information dissemination by packets

Gossiping in a distributed network

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

Parallel algorithms for gossiping by mail

Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

On Adaptive System Diagnosis

On computing a conditional edge-connectivity of a graph

A cycle structure theorem for hamiltonian graphs

Sequential information dissemination by packets

On minimum fault-tolerant networks

Star arboricity of graphs

Distributed diagnosis and the system user

Orienting graphs to optimize reachability

Locations on time-varying networks

Optimum Locations of Centers in Networks

A parallel fault identification algorithm

Locating replicas of a database on a network

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

A Graph-Theoretic Approach to a Class of Integer-Programming Problems

Suchergebnisse filtern