Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic ScholarSIAM Journal on Discrete Mathematics, Volume 5
Volume 5, Number 1, February 1992
- Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Broadcasting in Bounded Degree Graphs. 10-24 - Hiroshi Nagamochi, Toshihide Ibaraki:
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. 54-66 - Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem. 112-116 - Michael R. Fellows, Michael A. Langston:
On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. 117-126
Volume 5, Number 2, May 1992
- Endre Boros, Yves Crama, Peter L. Hammer:
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. 163-177 - Luisa Gargano, Ugo Vaccaro:
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults. 178-198 - Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee:
An Optimal Algorithm for the Maximum Two-Chain Problem. 285-304
Volume 5, Number 3, August 1992
- Sunil Chopra:
Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems. 321-337 - Jørgen Bang-Jensen, Carsten Thomassen:
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. 366-376 - Donald I. Cartwright, Wolfgang Woess:
Infinite Graphs with Nonconstant Dirichlet Finite Harmonic Functions. 380-385 - Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg:
Comparing Queues and Stacks as Mechanisms for Laying out Graphs. 398-412 - Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston:
Short Encodings of Evolving Structures. 428-450
Volume 5, Number 4, November 1992
- Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone:
Pair-Splitting Sets in AG(m, q). 451-459 - Seyoum Getu, Louis W. Shapiro, Wen-Jin Woan, Leon C. Woodson:
How to Guess a Generating Function. 497-499 - Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts:
2-Competition Graphs. 524-538 - Bala Kalyanasundaram, Georg Schnitger:
The Probabilistic Communication Complexity of Set Intersection. 545-557 - Maria M. Klawe, Frank Thomson Leighton:
A Tight Lower Bound on the Size of Planar Permutation Networks. 558-563
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-23 21:05 CEST by the dblp team