Titlebook: ;

飞来飞去真休

H. H. Hagedorn,J. G. Hildebrand,J. H. Law.-complete for chordal graphs in general, while the Krausz dimension of a chordal graph with bounded clique size can be determined in polynomial time. We also show that for any fixed k, it can be decided in polynomial time if an interval graph has Krausz dimension at most ..

Cuisine

Off-line and on-line call-scheduling in stars and trees,S for calls with unit durations is shown to have performance ratio at most .. In tree networks with . nodes, a variant of LS for calls with unit durations has performance ratio at most 6, and a variant for calls with arbitrary durations has performance ratio at most 5 log ..

Occupation

Computational complexity of the Krausz dimension of graphs,.-complete for chordal graphs in general, while the Krausz dimension of a chordal graph with bounded clique size can be determined in polynomial time. We also show that for any fixed k, it can be decided in polynomial time if an interval graph has Krausz dimension at most ..

拾落穗

Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT,llows to change either one item, or all the items in the current solution. The total time required to maintain 5/2-approximate solutions, while an arbitrary sequence of q constraint insertions and deletions is performed, is .. + . · .). This give .(.) amortized time per update over a sequence of .(.) operations.

Innocence

Trigger-Point

Computing the independence number of dense triangle-free graphs,h minimum degree δ > (1 − ε)., the situation is different for triangle-free graphs. It will be shown that for triangle-free graphs with δ > ./3 the independence number can be computed as fast as matrix multiplication, while within the class of triangle-free graphs with δ > (1-ε)./4 the problem is already .-hard.

Progesterone

Ossification

出血

On greedy matching ordering and greedy matchable graphs, these graphs, called greedy matchable graphs, are a subclass of weakly triangulated graphs and contain strongly chordal graphs and chordal bipartite graphs as proper subclasses. The question when can this ordering be produced efficiently is discussed too.

Pageant