1952 search results - page 141 / 391 » Complete partitions of graphs |
143
click to vote
CPC
2006
15 years 4 months ago
2006
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
119
click to vote
4OR
2005
15 years 4 months ago
2005
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
150
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
178
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
174
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...