288 search results - page 23 / 58 » On the number of maximal independent sets in a graph |
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
115
click to vote
WG
2010
Springer
14 years 8 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
MICS
2010
14 years 4 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
JCT
2010
14 years 8 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...