1729 search results - page 72 / 346 » On Bounds for the k-Partitioning of Graphs |
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
CATA
2007
14 years 11 months ago
2007
This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations...
JGT
2008
14 years 10 months ago
2008
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
WABI
2007
Springer
15 years 4 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...