3471 search results - page 266 / 695 » Obstacle Numbers of Graphs |
154
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. To impro...
165
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
145
click to vote
AUSDM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a prototype application for graph-based data exploration and mining, with particular emphasis on scientific data. The application has a Flash-based graphical i...
191
click to vote
CCCG
2010
15 years 7 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
171
click to vote
UAI
2004
15 years 7 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...