803 search results - page 102 / 161 » Independence in Direct-Product Graphs |
121
Voted
JMLR
2010
14 years 7 months ago
2010
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
133
click to vote
ALGOSENSORS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
135
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
113
click to vote
AICCSA
2007
IEEE
15 years 7 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
100
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...