75 search results - page 1 / 15 » Finding small balanced separators |
STOC
2006
ACM
14 years 11 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
JCO
2010
13 years 9 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
BMCBI
2006
13 years 11 months ago
2006
Background: Normalization of gene expression microarrays carrying thousands of genes is based on assumptions that do not hold for diagnostic microarrays carrying only few genes. T...
WEA
2007
Springer
14 years 5 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
ICTAC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...