42230 search results - page 218 / 8446 » Algorithms and Complexity Results for |
145
click to vote
COCOON
2007
Springer
16 years 22 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
177
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
182
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
215
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
185
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...