5473 search results - page 173 / 1095 » On the graph isomorphism problem |
173
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
185
click to vote
ISAAC
1998
Springer
15 years 11 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
153
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
167
Voted
APPML
2006
15 years 7 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
189
click to vote
IANDC
2008
15 years 7 months ago
2008
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...