Sciweavers

796 search results - page 13 / 160
» The Anonymous Subgraph Problem
Sort
View
IPCO
1993
98views Optimization» more  IPCO 1993»
13 years 8 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
ACID
2006
237views Algorithms» more  ACID 2006»
13 years 8 months ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos
ESORICS
2009
Springer
13 years 5 months ago
Anonymity and Historical-Anonymity in Location-Based Services
The problem of protecting user's privacy in Location-Based Services (LBS) has been extensively studied recently and several defense techniques have been proposed. In this cont...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...
FSTTCS
2007
Springer
14 years 1 months ago
Covering Graphs with Few Complete Bipartite Subgraphs
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
Herbert Fleischner, Egbert Mujuni, Daniël Pau...
STACS
2010
Springer
14 years 2 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn