Sciweavers

1461 search results - page 159 / 293
» Complexity of Graph Covering Problems
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 11 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
ICCV
2007
IEEE
16 years 8 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
ATAL
2008
Springer
15 years 8 months ago
Coalitional skill games
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
Yoram Bachrach, Jeffrey S. Rosenschein
KI
2010
Springer
15 years 1 months ago
Lifelong Map Learning for Graph-based SLAM in Static Environments
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
Henrik Kretzschmar, Giorgio Grisetti, Cyrill Stach...