<--- Back to Details
First PageDocument Content
Interval graph / Graph operations / Path decomposition / Graph theory / Clique / Graph coloring
Date: 2007-03-18 12:58:02
Interval graph
Graph operations
Path decomposition
Graph theory
Clique
Graph coloring

Add to Reading List

Source URL: lca.ceid.upatras.gr

Download Document from Source Website

File Size: 247,24 KB

Share Document on Facebook

Similar Documents

Interval Deletion is Fixed-Parameter Tractable∗ Yixin Cao† Abstract We study the minimum interval deletion problem, which asks for the removal of a set of at most k vertices to make a graph on n vertices into an inte

DocID: 1uodY - View Document

Software engineering / Compiler construction / Computer programming / Graph theory / Mathematics / Dominator / Data-flow analysis / Control flow / Interval / Control theory / Infinite loop / Graph

Control-Flow Analysis Last time – Undergraduate compilers in a day Today – Control-flow analysis – Building basic blocks

DocID: 1rrVx - View Document

Graph theory / Graph coloring / Defective coloring / Maximal independent set / Independent set / Interval edge coloring / MaxCliqueDyn maximum clique algorithm

Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science,

DocID: 1rrEj - View Document

Graph theory / Graph coloring / Independent set / Interval graph / Interval scheduling / Perfect graph / Interval edge coloring

Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗

DocID: 1rd8U - View Document

Graph theory / Graph coloring / Ear decomposition / Matroid theory / Morphisms / Line graph / Interval edge coloring

Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

DocID: 1r2FO - View Document