4137 search results - page 546 / 828 » On the number of matchings of a tree |
167
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
186
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
177
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
154
click to vote
COCOON
2007
Springer
16 years 28 days ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
179
click to vote
FSTTCS
2007
Springer
16 years 27 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...