Sciweavers

14 search results - page 2 / 3
» Flips in Graphs
Sort
View
SIAMDM
2010
95views more  SIAMDM 2010»
13 years 1 days ago
Flips in Graphs
Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pi...
DATE
1998
IEEE
82views Hardware» more  DATE 1998»
13 years 9 months ago
Exploiting Symbolic Techniques for Partial Scan Flip Flop Selection
Partial Scan techniques have been widely accepted as an effective solution to improve sequential ATPG performance while keeping acceptable area and performance overheads. Several ...
Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda,...
GLOBECOM
2008
IEEE
13 years 11 months ago
Robust Distributed Sensor Network Localization Based on Analysis of Flip Ambiguities
Abstract— A major problem in wireless sensor network localization is erroneous local geometric realizations in some parts of the network due to the sensitivity to certain distanc...
Anushiya A. Kannan, Baris Fidan, Guoqiang Mao
IPL
2006
98views more  IPL 2006»
13 years 5 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 5 months ago
Bounding the Number of Edges in Permutation Graphs
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
Peter Keevash, Po-Shen Loh, Benny Sudakov