990 search results - page 19 / 198 » Sub-Graphs of Complete Graph |
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
116
click to vote
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...