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: Author="McKay, Brendan D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Practical graph isomorphism, II
Brendan D. McKay
,
Adolfo Piperno
Journal Symbolic Computation
60
, 2014, pp. 94-112
Competition numbers, quasi-line graphs, and holes
Brendan D. McKay
,
Pascal Schweitzer
,
Patrick Schweitzer
SIAM Journal on Discrete Mathematics
28
(1), 2014, pp. 77-91
Switching reconstruction of digraphs
Brendan D. McKay
,
Pascal Schweitzer
Journal of Graph Theory
76
(4), 2014, pp. 279-296
Asymptotic enumeration of sparse multigraphs with given degrees
Catherine Greenhill
,
Brendan D. McKay
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 2064-2089
A note on the history of the four-colour conjecture
Brendan D. McKay
Journal of Graph Theory
72
(3), 2013, pp. 361-363
Asymptotic enumeration of integer matrices with large equal row and column sums
E. Rodney Canfield
,
Brendan D. McKay
Combinatorica
30
(6), 2010, pp. 655-680
Asymptotic enumeration of dense 0-1 matrices with specified line sums
E. Rodney Canfield
,
Catherine Greenhill
,
Brendan D. McKay
Journal of Combinatorial Theory Series A
115
(1), 2008, pp. 32-66
A census of small Latin hypercubes
Brendan D. McKay
,
Ian M. Wanless
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 719-736
Computing symmetries of combinatorial objects
Brendan D. McKay
Lecture Notes in Computer Science
4875
, 2008, pp. 1-1
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums
Catherine Greenhill
,
Brendan D. McKay
,
Xiaoji Wang
Journal of Combinatorial Theory Series A
113
(2), 2006, pp. 291-324
The distributions of the entries of young tableaux
Brendan D. McKay
,
Jennifer Morse
,
Herbert S. Wilf
Journal of Combinatorial Theory Series A
97
(1), 2002, pp. 117-128
Nonhamiltonian 3-connected cubic planar graphs
R.E.L. Aldred
,
S. Bau
,
D.A. Holton
,
Brendan D. McKay
SIAM Journal on Discrete Mathematics
13
(1), 2000, pp. 25-32
TrExML: A maximum-likelihood approach for extensive tree-space exploration
Marty J. Wolf
,
Simon Easteal
,
Margaret Kahn
,
Brendan D. McKay
,
Lars S. Jermiin
Bioinformatics
16
(4), 2000, pp. 383-394
Cycles through 23 vertices in 3-connected cubic planar graphs
R.E.L. Aldred
,
S. Bau
,
D.A. Holton
,
Brendan D. McKay
Graphs and Combinatorics
15
(4), 1999, pp. 373-376
A note on large graphs of diameter two and given maximum degree
Brendan D. McKay
,
Mirka Miller
,
Jozef S̑irán̑
Journal of Combinatorial Theory Series B
74
(1), 1998, pp. 110-118
Isomorph-free exhaustive generation
Brendan D. McKay
Journal of Algorithms
26
(2), 1998, pp. 306-324
The asymptotic number of labeled graphs with
n
vertices,
q
edges, and no isolated vertices
Edward A. Bender
,
E. Rodney Canfield
,
Brendan D. McKay
Journal of Combinatorial Theory Series A
80
(1), 1997, pp. 124-150
Subgraph counting identities and Ramsey numbers
Brendan D. McKay
,
Stanisƚaw P. Radziszowski
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 193-209
NC
algorithm for dynamically solving the all pairs shortest path problem and related problems
Weifa Liang
,
Brendan D. McKay
,
Hong Shen
Information Processing Letters
58
(3), 1996, pp. 149-155
Vertex-transitive graphs that are not Cayley graphs. II
Brendan D. McKay
,
Cheryl E. Praeger
Journal of Graph Theory
22
(4), 1996, pp. 321-334
Asymptotic enumeration of tournaments with a given score sequence
Brendan D. McKay
,
Xiaoji Wang
Journal of Combinatorial Theory Series A
73
(1), 1996, pp. 77-90
R(4,5) = 25
Brendan D. McKay
,
Stanisƚaw P. Radziszowski
Journal of Graph Theory
19
(3), 1995, pp. 309-322
Linear programming in some Ramsey problems
Brendan D. McKay
,
Stanisƚaw P. Radziszowski
Journal of Combinatorial Theory Series B
61
(1), 1994, pp. 125-132
The value of the Ramsey number
R(3,8)
Brendan D. McKay
,
Zhang Ke Min
Journal of Graph Theory
16
(1), 1992, pp. 99-105
The first classical Ramsey number for hypergraphs is computed
Brendan D. McKay
,
Stanislaw P. Radziszowski
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 304-308
Seiten 1
2
>