Sciweavers

1664 search results - page 138 / 333
» Distance labeling in graphs
Sort
View
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
15 years 10 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
CIIA
2009
15 years 5 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
119
Voted
DM
2006
108views more  DM 2006»
15 years 4 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»
15 years 4 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
15 years 10 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