62 search results - page 7 / 13 » Parameterized complexity of the induced subgraph problem in ... |
STACS
2001
Springer
13 years 12 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
ISCAS
2003
IEEE
14 years 25 days ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
COMBINATORICS
2007
13 years 7 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
WG
1998
Springer
13 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....