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=Discrete Appl.~Math. AND YEAR=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Representative graphs of
r
-regular partial planes and representation of orthomodular posets
F.D. Anger
,
R.V. Rodriguez
,
J. Sarmiento
Discrete Applied Mathematics
15
, 1986, pp. 1-10
The matching polynomial of a polygraph
Darko Babić
,
Ante Graovac
,
Bojan Mohar
,
Tomaz̑ Pisanski
Discrete Applied Mathematics
15
, 1986, pp. 11-24
On the ordering of graphs with respect to their matching numbers
Ivan Gutman
,
Fuji Zhang
Discrete Applied Mathematics
15
, 1986, pp. 25-33
A fast approximation algorithm for the multicovering problem
Nicholas G. Hall
,
Dorit S. Hochbaum
Discrete Applied Mathematics
15
, 1986, pp. 35-40
Maximal dynamic polymatroid flows and applications
Horst W. Hamacher
Discrete Applied Mathematics
15
, 1986, pp. 41-54
On morphic generation of regular languages
T. Harju
,
J. Karhumäki
,
H.C.M. Kleijn
Discrete Applied Mathematics
15
, 1986, pp. 55-60
A polynomial algorithm for constructing the clique graph of a line graph
Bruce Hedman
Discrete Applied Mathematics
15
, 1986, pp. 61-66
On the number of edges in the transitive closure of a graph
W.F. McColl
,
K. Noshita
Discrete Applied Mathematics
15
, 1986, pp. 67-73
On the order of the largest induced tree in a random graph
Zbigniew Palka
,
Andrzej Ruciński
Discrete Applied Mathematics
15
, 1986, pp. 75-83
Linear and combinatorial sharing problems
Uwe Zimmermann
Discrete Applied Mathematics
15
, 1986, pp. 85-104
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time
Joan Feigenbaum
Discrete Applied Mathematics
15
, 1986, pp. 105-110
Iterative characterizations of boolean algebras
Corina Reischer
,
Dan Simovici
Discrete Applied Mathematics
15
, 1986, pp. 111-116
A property of real-time trellis automata
Sheng Yu
Discrete Applied Mathematics
15
, 1986, pp. 117-119
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
Egon Balas
Discrete Applied Mathematics
15
, 1986, pp. 123-134
Greedy concepts for network flow problems
Wolfgang W. Bein
,
Peter Brucker
Discrete Applied Mathematics
15
, 1986, pp. 135-144
New classes of perfect graphs
Claude Berge
Discrete Applied Mathematics
15
, 1986, pp. 145-154
On chains of 3-connected matroids
Robert E. Bixby
,
Collette R. Coullard
Discrete Applied Mathematics
15
, 1986, pp. 155-166
Optimal schedules for periodically recurring events
Rainer E. Burkard
Discrete Applied Mathematics
15
, 1986, pp. 167-180
Most and least uniform spanning trees
Paolo M. Camerini
,
Francesco Maffioli
,
Silvano Martello
,
Paolo Toth
Discrete Applied Mathematics
15
, 1986, pp. 181-197
On
K^{\Delta}
Sung-Jin Chung
,
Katta G. Murty
,
Soo Y. Chang
Discrete Applied Mathematics
15
, 1986, pp. 199-211
Generalized neighbourhoods and a class of perfectly orderable graphs
M. Cochand
,
D. de Werra
Discrete Applied Mathematics
15
, 1986, pp. 213-220
Strong unimodularity for matrices and hypergraphs
Yves Crama
,
Peter L. Hammer
,
Toshihide Ibaraki
Discrete Applied Mathematics
15
, 1986, pp. 221-239
Monge sequences and a simple assignment algorithm
U. Derigs
,
O. Goecke
,
R. Schrader
Discrete Applied Mathematics
15
, 1986, pp. 241-248
Exchange properties of combinatorial closure spaces
Ulrich Faigle
Discrete Applied Mathematics
15
, 1986, pp. 249-260
On the computational complexity of the order polynomial
Ulrich Faigle
,
Rainer Schrader
Discrete Applied Mathematics
15
, 1986, pp. 261-269
Seiten 1
2
3
4
>