183 search results - page 9 / 37 » Complete Minors and Independence Number |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper...
CAI
2004
Springer
13 years 7 months ago
2004
Springer
A complete hardware implementation of an evolvable combinational unit for FPGAs is presented. The proposed combinational unit consisting of a virtual reconfigurable circuit and evo...
COCOON
2009
Springer
14 years 2 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...
ACSAC
2007
IEEE
14 years 1 months ago
2007
IEEE
In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Often these networks ...
ICALP
2003
Springer
14 years 22 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...