5100 search results - page 16 / 1020 » The Linear Complexity of a Graph |
PODS
2001
ACM
14 years 8 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
MICAI
2005
Springer
14 years 1 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
CPM
1999
Springer
14 years 1 days ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
WG
2007
Springer
14 years 1 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...