Stefan Felsner, Rudolf Müller, Lorenz Wernisch  Home/Search
Context
Related
| fubinf.inf.fuberlin...trb9402.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: inf.fuberlin.de/inst/a...1994.en (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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]. They propose an O(n 2 ) algorithm for chromatic number and a less efficient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, i.e., O(n log n), algorithms for chromatic number, weighted independent set, clique cover and... (Update)
Similar documents (at the sentence level):
60.0%: Trapezoid Graphs and Generalizations, Geometry and Algorithms - Felsner, Müller, Wernisch (1993) (Correct)
Active bibliography (related documents): More All
0.0: The Complexity of Scheduling Graphs of Bounded Width Subject to.. - Verriet (1997) (Correct)
0.0: Scheduling Research Grant Proposal Evaluation - Meetings Patrick Healy (Correct)
0.0: Generalizations of tournaments: A survey - Bang-Jensen, Gutin (1996) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Trapezoid Order Classification - Ryan (1996) (Correct)
0.6: Proper And Unit Trapezoid Orders And Graphs - Bogart, Möhring, Ryan (1996) (Correct)
0.5: Asteroidal Triple-Free Graphs - Corneil, Olariu, Stewart (1997) (Correct)
BibTeX entry: (Update)
@inproceedings{ felsner94trapezoid,
author = "Stefan Felsner and Rudolf Muller and Lorenz Wernisch",
title = "Trapezoid Graphs and Generalizations, Geometry and Algorithms",
booktitle = "Scandinavian Workshop on Algorithm Theory",
pages = "143-154",
year = "1994",
url = "citeseer.ist.psu.edu/article/felsner94trapezoid.html" }
Citations (may not include all citations):28 Computing a maximum cardinality matching in a bipartite grap.. (context) - Alt, Blum et al.
Documents on the same site (http://www.inf.fu-berlin.de/inst/ag-ti/publications/1994.en.html):
On-Line Chain Partitions of Orders - Felsner (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC