Complexity measures of sign matrices
- 作者Nati Linial; Shahar Mendelson; Gideon Schechtman; Adi Shraibman
- 卷第27卷
- 期第4期
- 印刷ISSN0209-9683
- 电子ISSN1439-6912
- 文件大小292.57KB
- 发表时间2007-07
- DOI10.1007/s00493-007-2160-5
- 页码439-463
The symmetric (2k, k)-graphsMatthias Kriesell · 2001
Average degree and contractibilityMatthias Kriesell · 2006
Vertex suppression in 3-connected graphsMatthias Kriesell · 2008
Balancing two spanning treesMatthias Kriesell · 2011
Onk-Critical Connected Line GraphsMatthias Kriesell · 1998
Contractible Subgraphs in 3-Connected GraphsMatthias Kriesell · 2000
What is on his mind?János Barát; Matthias Kriesell · 2010
Disjoint A-paths in digraphsMatthias Kriesell · 2005
Diametric theorems in sequence spacesR. Ahlswede; N. Cai; Z. Zhang · Combinatorica · 1992
Small transversals in hypergraphsV. Chvátal; C. McDiarmid · Combinatorica · 1992
On integer points in polyhedraW. Cook; M. Hartmann; R. Kannan; C. McDiarmid · Combinatorica · 1992
Spanning trees of extended graphsA. K. Kelmans · Combinatorica · 1992
On rank vs. communication complexityNoam Nisan; Avi Wigderson · Combinatorica · 1995
Colouring a graph frugallyHugh Hind; Michael Molloy; Bruce Reed · Combinatorica · 1997
Expanding graphs and invariant meansYehuda Shalom · Combinatorica · 1997
Universally signable graphsMichele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković · Combinatorica · 1997