3204 search results - page 197 / 641 » The b-chromatic Number of a Graph |
DM
1998
13 years 10 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
PRL
1998
13 years 10 months ago
1998
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
JGT
2010
13 years 9 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
COMBINATORICS
2007
13 years 10 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...