796 search results - page 38 / 160 » The Anonymous Subgraph Problem |
TCS
2010
13 years 9 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
EDBT
2009
ACM
14 years 5 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
WINET
2010
13 years 9 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
ISAAC
2007
Springer
14 years 5 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...