106 search results - page 6 / 22 » Dominating direct products of graphs |
ECCC
2006
14 years 11 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
A well known computationally efficient method for parameters estimation of linear frequency modulated (LFM) signals is to mix the received signals with a shifted version of itsel...
105
click to vote
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
DM
2008
14 years 11 months ago
2008
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
155
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...