45 search results - page 1 / 9 » A New Method for Enumerating Independent Sets of a Fixed Siz... |
CANDC
2005
ACM
13 years 4 months ago
2005
ACM
We introduce a new family of metrics for graphs of fixed size, based on counting-independent sets. Our definition is simpler and easier to e than the edge ideal metric family defi...
DM
2010
13 years 5 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
CASES
2007
ACM
13 years 8 months ago
2007
ACM
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
NIPS
2007
13 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...