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
Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
TL;DR: This paper presents an optimal sequential and an optimal parallel algorithm to compute a minimum cardinality Steiner set and a Steiner tree on an EREW PRAM model.
Journal ArticleDOI
The permutation-path coloring problem on trees
TL;DR: It is shown that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, and that the average number of colors needed to color any permutation on a linear network on n vertices is n/4 + o(n).
Journal ArticleDOI
Fast learning of scale‐free networks based on Cholesky factorization
Vladisav Jelisavcic,Vladisav Jelisavcic,Ivan Stojkovic,Ivan Stojkovic,Veljko Milutinovic,Zoran Obradovic +5 more
TL;DR: Evaluation on synthetically generated examples and high‐impact applications from a biomedical domain of up to more than 900,000 variables provides evidence that for such tasks the SNETCH algorithm can learn the underlying structure more accurately, and an order of magnitude faster than state‐of‐the‐art approaches based on the L1 penalized precision matrix.
Book ChapterDOI
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs
TL;DR: The dot product model assumes that two individuals are connected in the social network if their attributes or opinions are similar, and the resulting graph is called a d-dot product graph.
Journal ArticleDOI
On economical set representations of graphs
Jing Kong,Yaokun Wu +1 more
TL;DR: A superclass of chordal graphs is introduced, defined in terms of a generalization of simplicial vertex and perfect elimination ordering, and the uniqueness of the minimum-size intersection representations for some graphs is studied.
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.