760 search results - page 129 / 152 » Algorithms for finding clique-transversals of graphs |
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
IADIS
2008
13 years 9 months ago
2008
Time series analysis is a wide area of knowledge that studies processes in their evolution. The classical research in the area tends to find global laws underlying the behaviour o...
CLA
2004
13 years 9 months ago
2004
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
DEXA
2010
Springer
13 years 7 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...