scispace - formally typeset
Journal ArticleDOI

Algorithmic graph theory and perfect graphs

Rolf H. Möhring
- 01 Jun 1986 - 
- Vol. 3, Iss: 2, pp 207-208
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

Optimal Algorithm for a Special Point-Labeling Problem

TL;DR: A good heuristic algorithm is developed that is observed to produce optimal solutions for most of the randomly generated instances and for all the standard benchmarks available in [13].
Journal Article

Sequences Characterizing k-Trees

TL;DR: In this article, the degree sequence of a 1-tree on n vertices is a nondecreasing sequence of n integers if and only if there are at least two 1's in the sequence, and the sum of the elements is 2(n - 1).
Journal ArticleDOI

Optimal algorithms for the channel-assignment problem on a reconfigurable array of processors with wider bus networks

TL;DR: The channel-assignment problem with N pairs of components is derived and it is shown that the algorithm runs in the equivalent time complexity while significantly reducing the number of processors to O(N).

Gray Code Results for Acyclic Orientations

TL;DR: In this paper, it was shown that for certain graphs G, AO(G) is hamiltonian, and given explicit constructions of hamilton cycles or paths for these graphs, including trees, complete graphs, chordal graphs, odd ladder graphs and odd wheel graphs.
ReportDOI

Statistical Inference in Graphical Models

K Gimpel, +1 more
TL;DR: The mathematical foundations of graphical models and statistical inference are described, focusing on the concepts and techniques that are most useful to the problem of decision making in dynamic systems under uncertainty.
References
More filters
BookDOI

Graphs and Order

Ivan Rival
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.