Sciweavers

24 search results - page 2 / 5
» The flipping puzzle on a graph
Sort
View
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
13 years 10 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
COMPGEOM
2007
ACM
13 years 9 months ago
Happy endings for flip graphs
David Eppstein
SIAMDM
2010
95views more  SIAMDM 2010»
12 years 11 months 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