Sciweavers

191 search results - page 28 / 39
» Intersections of graphs
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 11 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
ICCAD
1997
IEEE
125views Hardware» more  ICCAD 1997»
13 years 11 months ago
A deductive technique for diagnosis of bridging faults
A deductive technique is presented that uses voltage testing for the diagnosis of single bridging faults between two gate input or output lines and is applicable to combinational ...
Srikanth Venkataraman, W. Kent Fuchs
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 5 months ago
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
Hung-Chin Jang
DAM
2011
13 years 2 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
JSW
2008
203views more  JSW 2008»
13 years 7 months ago
Automatic Discovery of Semantic Relations Based on Association Rule
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
Xiangfeng Luo, Kai Yan, Xue Chen