Sciweavers

2432 search results - page 100 / 487
» Degrees and choice numbers
Sort
View
DAM
2008
108views more  DAM 2008»
15 years 6 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz
4OR
2004
57views more  4OR 2004»
15 years 6 months ago
The generation of stable project plans
This text summarises the PhD thesis that Roel Leus presented to obtain the degree of Doctor in Applied Economics at the Katholieke Universiteit Leuven, in September 2003. The promo...
Roel Leus
ADVCS
2004
65views more  ADVCS 2004»
15 years 6 months ago
Multiscale Complexity/Entropy
We discuss the role of scale dependence of entropy/complexity and its relationship to component interdependence. The complexity as a function of scale of observation is expressed ...
Y. Bar-Yam
COMBINATORICS
1999
93views more  COMBINATORICS 1999»
15 years 6 months ago
Induced Complete h-partite Graphs in Dense Clique-less Graphs
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
Eldar Fischer
FCS
2009
15 years 4 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick