Titlebook: LATIN 2000: Theoretical Informatics; 4th Latin American S Gaston H. Gonnet,Alfredo Viola Conference proceedings 2000 Springer-Verlag Berlin

CHAFF

書目名稱LATIN 2000: Theoretical Informatics影響因子(影響力)




書目名稱LATIN 2000: Theoretical Informatics影響因子(影響力)學科排名




書目名稱LATIN 2000: Theoretical Informatics網(wǎng)絡公開度




書目名稱LATIN 2000: Theoretical Informatics網(wǎng)絡公開度學科排名




書目名稱LATIN 2000: Theoretical Informatics被引頻次




書目名稱LATIN 2000: Theoretical Informatics被引頻次學科排名




書目名稱LATIN 2000: Theoretical Informatics年度引用




書目名稱LATIN 2000: Theoretical Informatics年度引用學科排名




書目名稱LATIN 2000: Theoretical Informatics讀者反饋




書目名稱LATIN 2000: Theoretical Informatics讀者反饋學科排名

脊椎動物

Cube Packingnce bound 3.466 and the other with 2.669. A parametric version of this problem is defined and results on online and offline algorithms are presented. We did not find in the literature offline algorithms with asymptotic performance bounds as good as 2.669.

指令

Approximation Algorithms for Flexible Job Shop Problemsf machines and the maximum number . of operations per job are fixed. We also study the preemptive version of the problem when . and . are fixed, and present a linear time (2 + .)-approximation algorithm for the problem with migration.

胰島素

雪崩

Polynomial Time Recognition of Clique-Width ≤? 3 GraphsThus, graphs of bounded Clique-width are a larger class than graphs of bounded tree-width, on which we can resolve fewer, but still many, optimization problems efficiently..In this paper we present the first polynomial time algorithm (.?(...)) to recognize graphs of at most 3.

Encoding

Edge Colouring Reduced Indifference Graphsor neighbourhood-overfull indifference graphs proving that a reduced indifference graph cannot be neighbourhood-overfull. We show that the chromatic index for all reduced indifference graphs is the maximum degree.

托運

Algorithmic Aspects of Regularityer, there is a fast deterministic algorithm for finding such an approximation, and therefore many of the existential results based on the regularity lemma could be turned into constructive results. In this survey, we discuss some recent developments concerning the algorithmic aspects of the regularity lemma.

DEMUR

constellation

Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphsops and multiple edges), with . vertices and approximately . edges, in which all sparse connected components are .-free. Next, we prove that for any . collection . of multicyclic graphs . connected graphs with . vertices and . + .(../3) edges are . -free. The same result holds for multigraphs.

催眠