Sciweavers

823 search results - page 53 / 165
» Brick partitions of graphs
Sort
View
CP
2005
Springer
15 years 11 months ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
ICIP
2006
IEEE
16 years 7 months ago
Generation of Long-Term Color and Motion Coherent Partitions
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
Camilo C. Dorea, Ferran Marqués, Montse Par...
WG
2007
Springer
16 years 6 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
COMBINATORICS
2000
81views more  COMBINATORICS 2000»
15 years 6 months ago
Interchangeability of Relevant Cycles in Graphs
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
16 years 13 days ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...