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
Book ChapterDOI
Partial commutation and traces
Volker Diekert,Yves Métivier +1 more
TL;DR: Parallelism and concurrency are fundamental concepts in computer science and concerns the authors' daily life whether software written for distributed systems behaves correctly.
Journal ArticleDOI
Survey: Certifying algorithms
TL;DR: A theory of certifying algorithms is started and it is proved that the concept is universal, which would greatly enhance the reliability of algorithmic software.
Journal ArticleDOI
Computing reliability and message delay for Cooperative wireless distributed sensor networks subject to random failures
TL;DR: This paper uses a probabilistic graph to model DSN, and defines the DSN reliability as the probability that there exists an operating communication path between the sink node, and at least one operational sensor in a target cluster, and shows that both problems are #P-hard for arbitrary networks.
Journal ArticleDOI
List Partitions
TL;DR: tools which allow us to classify the complexity of many list partition problems and, in particular, yield the complete classification for small matrices M, and it is shown that the dichotomy (NP-complete versus polynomial time solvable), conjectured for certain graph homomorphism problems, would, if true, imply a slightly weaker dichotomies for these problems.
DissertationDOI
Stochastic resource-constrained project scheduling
TL;DR: The scope of the project was to develop algorithms and theory for stochastic resource-constrained project scheduling problems which is the main topic of this thesis.
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.