2354 search results - page 349 / 471 » Radio number for trees |
144
click to vote
FMCAD
2009
Springer
16 years 28 days ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
152
click to vote
FOCS
2008
IEEE
16 years 25 days 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...
174
click to vote
HICSS
2008
IEEE
16 years 25 days 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...
149
click to vote
COCOON
2007
Springer
16 years 16 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...
173
click to vote
FSTTCS
2007
Springer
16 years 16 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...