Sciweavers

796 search results - page 15 / 160
» The Anonymous Subgraph Problem
Sort
View
IPL
2010
158views more  IPL 2010»
13 years 4 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
ICIW
2008
IEEE
14 years 1 months ago
On Secure and Anonymous Buyer-Seller Watermarking Protocol
—Buyer-seller watermarking protocols incorporates digital watermarking with cryptography, in order to protect digital copyrights and privacy rights for the seller and the buyer b...
Mina Deng, Bart Preneel
JDA
2006
83views more  JDA 2006»
13 years 7 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
ICRA
2010
IEEE
112views Robotics» more  ICRA 2010»
13 years 5 months ago
On the solvability of the Mutual Localization problem with Anonymous Position Measures
— This paper formulates and investigates a novel problem called Mutual Localization with Anonymous Position Measures. This is an extension of Mutual Localization with Position Me...
Antonio Franchi, Giuseppe Oriolo, Paolo Stegagno
KAIS
2010
139views more  KAIS 2010»
13 years 5 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf