3204 search results - page 338 / 641 » The b-chromatic Number of a Graph |
162
click to vote
ARSCOM
2007
15 years 7 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
247
click to vote
IPL
2006
15 years 6 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
156
click to vote
JCP
2006
15 years 6 months ago
2006
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
196
click to vote
JUCS
2006
15 years 6 months ago
2006
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
200
click to vote
NETWORKS
2008
15 years 6 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...