163 search results - page 9 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove t...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...