823 search results - page 157 / 165 » Brick partitions of graphs |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
109
click to vote
INFORMS
1998
14 years 11 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
109
click to vote
KDD
2007
ACM
16 years 3 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
124
click to vote
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
STACS
2007
Springer
15 years 5 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...