Sciweavers

3396 search results - page 168 / 680
» Tree representations of graphs
Sort
View
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
14 years 1 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
VIS
2007
IEEE
117views Visualization» more  VIS 2007»
14 years 10 months ago
IStar: A Raster Representation for Scalable Image and Volume Data
Topology has been an important tool for analyzing scalar data and flow fields in visualization. In this work, we analyze the topology of multivariate image and volume data sets wit...
Joe Kniss, Warren Hunt, Kristin Potter, Pradeep...
ECAI
2006
Springer
14 years 24 days ago
Compact Representation of Sets of Binary Constraints
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
Jussi Rintanen
COCOON
1999
Springer
14 years 1 months ago
Multi-coloring Trees
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
Magnús M. Halldórsson, Guy Kortsarz,...
IPCO
2008
91views Optimization» more  IPCO 2008»
13 years 10 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....