Sciweavers

1154 search results - page 99 / 231
» On the editing distance of graphs
Sort
View
CIIA
2009
13 years 11 months ago
Ontology-Driven Method for Ranking Unexpected Rules
Several rule discovery algorithms have the disadvantage to discover too much patterns sometimes obvious, useless or not very interesting to the user. In this paper we propose a new...
Mohamed Said Hamani, Ramdane Maamri
DM
2006
108views more  DM 2006»
13 years 10 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
JGT
2008
77views more  JGT 2008»
13 years 10 months ago
List-coloring the square of a subcubic graph
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
Daniel W. Cranston, Seog-Jin Kim
KBSE
2005
IEEE
14 years 3 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
CORR
2011
Springer
223views Education» more  CORR 2011»
13 years 5 months ago
Decentralized Formation Control Part I: Geometric Aspects
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
Mohamed-Ali Belabbas