110 search results - page 22 / 22 » A degree bound on decomposable trees |
118
Voted
ALGORITHMICA
1998
14 years 11 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
99
Voted
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
122
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
117
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
135
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...