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
Posted Content
Dynamic programming in in uence diagrams with decision circuits
TL;DR: DecDecision circuits as discussed by the authors perform efficient evaluation of influence diagrams, building on the ad-vances in arithmetic circuits for belief net- work inference. But they are not suitable for dynamic programming.
Nonparametric maximum likelihood estimation for bivariate censored data
TL;DR: In this paper, the authors study the behavior of the maximum likelihood estimator (MLE) for bivariate censored data and introduce an algorithm for computing the MLE which is significantly faster than the other methods of which they are aware.
Proceedings Article
Inferring ordered trees from local constraints
TL;DR: A machine for automatically opening oppositely disposed handles or bails which are collapsed into and onto the bottom of continuously moving bakery baskets or trays.
Journal ArticleDOI
A software engineering perspective on algorithmics
TL;DR: A set of concrete goals, which are general and problem-independent and might appear ubiquitously in the algorithmic realm are presented, illustrated, motivated, and justified by an extensive requirements analysis for a particular algorithm from a particular algorithmic domain: Dijkstra's algorithm for shortest paths in networks.
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.