Sciweavers

Share
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
9 years 9 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
JGAA
2010
128views more  JGAA 2010»
9 years 10 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
9 years 11 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
DM
2006
87views more  DM 2006»
9 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
UAI
2008
10 years 27 days ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
CC
2006
Springer
132views System Software» more  CC 2006»
10 years 3 months ago
Register Allocation for Programs in SSA-Form
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
Sebastian Hack, Daniel Grund, Gerhard Goos
WG
1993
Springer
10 years 3 months ago
Dually Chordal Graphs
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
Andreas Brandstädt, Feodor F. Dragan, Victor ...
STACS
1994
Springer
10 years 3 months ago
On the Complexity of the Maximum Cut Problem
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
Hans L. Bodlaender, Klaus Jansen
WG
2005
Springer
10 years 5 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
MFCS
2007
Springer
10 years 5 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
books