796 search results - page 43 / 160 » The Anonymous Subgraph Problem |
122
Voted
SIROCCO
2001
15 years 3 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
125
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
175
Voted
SPC
2005
Springer
15 years 8 months ago
2005
Springer
The ephemeral pairing problem requires two or more specific physical nodes in a wireless broadcast network, that do not yet know each other, to establish a short-term relationship...
115
click to vote
COMBINATORICS
2007
15 years 2 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
105
click to vote
JGT
2006
15 years 2 months ago
2006
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...