Graph algorithm

From: C.Aymon (www.cyamon.com)
Date: 10/19/04 

Date: Tue, 19 Oct 2004 18:58:29 +0200

I am looking for an algorithm to solve the following problem:

A graph G has n nodes.
Find a subgraph S of G, having m nodes, so that
every node of S is connected to every other node of S.

Typically: n = 20 and m = 12.

Thank you for any hint.

Christian

Relevant Pages

  • Re: maximum common subgraph
    ... What is the largest subgraph of G1 isomorphic to a ... the algorithm does not produce the desired result. ... The graph you drew is *NOT* the modular product graph, ...
    (comp.theory)
  • Re: Graph algorithm
    ... > I am looking for an algorithm to solve the following problem: ... > A graph G has n nodes. ... > Find a subgraph S of G, having m nodes, so that ... Gibbs-Poole-Stockmeyer, and keep the first m nodes. ...
    (sci.math)
  • Re: Graph algorithm
    ... Gordo wrote: ... >>A graph G has n nodes. ... >>Find a subgraph S of G, having m nodes, so that ... an algorithm that works on your graphs. ...
    (sci.math)
  • Re: Graph algorithm
    ... >I am looking for an algorithm to solve the following problem: ... >A graph G has n nodes. ... >Find a subgraph S of G, having m nodes, so that ... Prune -- count the connectedness of each node. ...
    (sci.math)
  • Re: Shortish paths
    ... For how many nodes and how many edges will the actual algorithm run ... original graph. ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
    (comp.theory)