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
Folded Spectrum VQE : A quantum computing method for the calculation of molecular excited states
TL;DR: In this paper , the authors proposed the Folded Spectrum (FS) method as an extension to the Variational Quantum Eigensolver (VQE) algorithm for the computation of molecular excited states.
Proceedings Article
A watermarking system for teaching students to respect intellectual property rights
TL;DR: The educational effectiveness of the WaterIP system is demonstrated by presenting ways of how it can be applied in class and it is shown that WaterIP helps to understand what intellectual property rights really stand for.
Dissertation
Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra
TL;DR: This thesis introduces sub-polyhedral compilation by using (Unit-)Two-Variable-Per-Inequality or (U)TVPI Polyhedra, and introduces algorithms that can be used to construct under-aproximations of the systems of constraints resulting from affine scheduling problems, and shows practically significant improvements when compared to a traditional LP solver.
Posted Content
The critical exponent: a novel graph invariant
TL;DR: This work considers the refined problem of characterizing the set of entrywise powers preserving positivity for matrices with a zero pattern encoded by G, and studies how the geometry of $G$ influences the set $\mathcal{H}_G$.
Journal ArticleDOI
Open Problems: 13
TL;DR: An n n i is defined as follows: Given a t ree edge {x, y} such t h a t x and y are b o t h of degree 3, denote the o ther neighbors of x by xl and x2 and the oTher neighbors of y by Yl and Y2.
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.