Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time

2005 ◽  
pp. 91-102 ◽  
Author(s):  
Daniel Meister
Keyword(s):  
Linear Time ◽  
Permutation Graphs

scholarly journals Treewidth and minimum fill-in on permutation graphs in linear time

2010 ◽  
Vol 411 (40-42) ◽  
pp. 3685-3700 ◽  
Author(s):  
Daniel Meister
Keyword(s):  
Linear Time ◽  
Permutation Graphs

scholarly journals Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

2010 ◽  
pp. 75-87 ◽  
Author(s):  
Pinar Heggernes ◽  
Pim van ’t Hof ◽  
Daniel Lokshtanov ◽  
Jesper Nederlof
Keyword(s):  
Linear Time ◽  
Permutation Graphs ◽  
Bipartite Permutation Graphs

ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES

2000 ◽  
Vol 11 (03) ◽  
pp. 423-443 ◽  
Author(s):  
MARTIN CHARLES GOLUMBIC ◽  
UDI ROTICS
Keyword(s):  
Linear Time ◽  
Interval Graph ◽  
Unit Interval ◽  
Perfect Graphs ◽  
The Other ◽  
Perfect Graph ◽  
Permutation Graph ◽  
Permutation Graphs ◽  
Graph Classes ◽  
Unit Interval Graph

Graphs of clique–width at most k were introduced by Courcelle, Engelfriet and Rozenberg (1993) as graphs which can be defined by k-expressions based on graph operations which use k vertex labels. In this paper we study the clique–width of perfect graph classes. On one hand, we show that every distance–hereditary graph, has clique–width at most 3, and a 3–expression defining it can be obtained in linear time. On the other hand, we show that the classes of unit interval and permutation graphs are not of bounded clique–width. More precisely, we show that for every [Formula: see text] there is a unit interval graph In and a permutation graph Hn having n2 vertices, each of whose clique–width is at least n. These results allow us to see the border within the hierarchy of perfect graphs between classes whose clique–width is bounded and classes whose clique–width is unbounded. Finally we show that every n×n square grid, [Formula: see text], n ≥ 3, has clique–width exactly n+1.

scholarly journals Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs

2013 ◽  
Vol E96.D (3) ◽  
pp. 419-425 ◽  
Author(s):  
Hirotoshi HONMA ◽  
Kodai ABE ◽  
Yoko NAKAJIMA ◽  
Shigeru MASUYAMA
Keyword(s):  
Linear Time ◽  
Circular Permutation ◽  
Permutation Graphs ◽  
Linear Time Algorithms

scholarly journals Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

2012 ◽  
Vol 26 (3) ◽  
pp. 1008-1021 ◽  
Author(s):  
Pinar Heggernes ◽  
Pim van 't Hof ◽  
Daniel Lokshtanov ◽  
Jesper Nederlof
Keyword(s):  
Linear Time ◽  
Permutation Graphs ◽  
Bipartite Permutation Graphs

A Real Time Control Architecture for Continuously Managing Patients in a Care Unit

1995 ◽  
Vol 34 (05) ◽  
pp. 475-488
Author(s):  
B. Seroussi ◽  
J. F. Boisvieux ◽  
V. Morice
Keyword(s):  
Real Time ◽  
Linear Time ◽  
Treatment Plan ◽  
Control Architecture ◽  
Real Time Control ◽  
Time Representation ◽  
Time Control ◽  
Continuous Support ◽  
Definition Of ◽  
Computerized System

Abstract:The monitoring and treatment of patients in a care unit is a complex task in which even the most experienced clinicians can make errors. A hemato-oncology department in which patients undergo chemotherapy asked for a computerized system able to provide intelligent and continuous support in this task. One issue in building such a system is the definition of a control architecture able to manage, in real time, a treatment plan containing prescriptions and protocols in which temporal constraints are expressed in various ways, that is, which supervises the treatment, including controlling the timely execution of prescriptions and suggesting modifications to the plan according to the patient’s evolving condition. The system to solve these issues, called SEPIA, has to manage the dynamic, processes involved in patient care. Its role is to generate, in real time, commands for the patient’s care (execution of tests, administration of drugs) from a plan, and to monitor the patient’s state so that it may propose actions updating the plan. The necessity of an explicit time representation is shown. We propose using a linear time structure towards the past, with precise and absolute dates, open towards the future, and with imprecise and relative dates. Temporal relative scales are introduced to facilitate knowledge representation and access.

Sign in / Sign up

Export Citation Format

Share Document