139 search results - page 3 / 28 » A New Algorithm for Multi-objective Graph Partitioning |
CORR
2012
Springer
12 years 2 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
SAC
2010
ACM
14 years 1 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
EVOW
2006
Springer
13 years 10 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
LICS
2003
IEEE
13 years 11 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
AUSAI
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...