Journal ArticleDOI
Algorithmic graph theory and perfect graphs
Reads0
Chats0
About:
This article is published in Order.The article was published on 1986-06-01. It has received 1324 citations till now. The article focuses on the topics: Trivially perfect graph & Perfect graph theorem.read more
Citations
More filters
Journal ArticleDOI
Perspectives of Monge properties in optimization
TL;DR: This paper presents a survey on Monge matrices and related Monge properties and their role in combinatorial optimization, and deals with the following three main topics: fundamental combinatorsial properties of Monge structures, applications of MonGE properties to optimization problems and recognition ofMonge properties.
Journal ArticleDOI
Tolerating failures of continuous-valued sensors
TL;DR: This paper presents a methodology for transforming a process control program that cannot tolerate sensor failures into one that can, and a hierarchy of sensor failure models is identified.
Journal ArticleDOI
Graphs of Some CAT(0) Complexes
TL;DR: The graphs of some piecewise Euclidean simplicial and cubical complexes having nonpositive curvature in the sense of Gromov's CAT(0) inequality are characterized and it is shown that the graphs of all these complexes and some more general classes of graphs have geodesic combings and bicombings verifying the 1- or 2-fellow traveler property.
Book
Reasoning about qualitative temporal information
TL;DR: In this paper, the problem of finding a scenario that is consistent with the information provided, and finding all the feasible relations between all pairs of intervals or points, has been studied.
Journal ArticleDOI
Bipartite permutation graphs
TL;DR: These characterizations lead to a linear time recognition algorithm, and to polynomial time algorithms for a number of NP-complete problems when restricted to graphs in this class of bipartite permutation graphs.
References
More filters
Journal ArticleDOI
Interval graphs and related topics
TL;DR: A more general paradigm for studying various classes of graphs is suggested which can be described as follows: when 9 is allowed to be an arbitrary family of sets, the class obtained as intersection graphs is all undirected graphs.