Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

64

APPML
2008

favoriteEmaildiscussreport

93views more APPML 2008»

A matrix characterization of interval and proper interval graphs

14 years 11 months ago

A matrix characterization of interval and proper interval graphs

Download algo.rwth-aachen.de

In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of this matrix representation every such graph is associated with a node versus node zero

George B. Mertzios

Real-time Traffic

APPML 2008 | Matrix Representation | Node Zeroone Matrix | Proper Interval Graphs |

claim paper

Related Content

» The Roberts characterization of proper and unit interval graphs

» An Optimal Algorithm for the kFixedEndpoint Path Cover on Proper Interval Graphs

» Minimal proper interval completions

» The minimum linear arrangement problem on proper interval graphs

» Induced Subgraph Isomorphism on Interval and Proper Interval Graphs

» Polynomial kernels for Proper Interval Completion and related problems

» Recognizing and representing proper interval graphs in parallel using merging and sorting

» LinearTime Recognition of Probe Interval Graphs

» Computing Role Assignments of Proper Interval Graphs in Polynomial Time

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	APPML
Authors	George B. Mertzios

Comments (0)