Sciweavers

WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
13 years 10 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
DAM
2000
121views more  DAM 2000»
13 years 11 months ago
Chordality and 2-factors in Tough Graphs
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, He...
DM
2006
87views more  DM 2006»
13 years 11 months ago
A vertex incremental approach for maintaining chordality
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
Anne Berry, Pinar Heggernes, Yngve Villanger
ALGORITHMICA
2010
145views more  ALGORITHMICA 2010»
13 years 11 months ago
Chordal Deletion is Fixed-Parameter Tractable
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
Dániel Marx
CASES
2007
ACM
14 years 3 months ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne