M
Min Chih Lin
Researcher at University of Buenos Aires
Publications - 34
Citations - 404
Min Chih Lin is an academic researcher from University of Buenos Aires. The author has contributed to research in topics: Chordal graph & Dominating set. The author has an hindex of 12, co-authored 33 publications receiving 368 citations. Previous affiliations of Min Chih Lin include Facultad de Ciencias Exactas y Naturales.
Papers
More filters
Journal ArticleDOI
On Balanced Graphs
TL;DR: Characterizations of balanced graphs by forbidden subgraphs and by clique sub graphs are proved and polynomial time combinatorial algorithms for the problems of stable set, clique-independent set andClique-transversal for one of these subclasses ofbalanced graphs are proposed.
Journal ArticleDOI
Normal Helly circular-arc graphs and its subclasses
TL;DR: This article describes characterizations for the subclasses of Helly circular-arc graphs, including forbidden induced subgraphs characterizations, and shows how these classes of graphs relate with straight and round digraphs.
Journal ArticleDOI
Isomorphism of graph classes related to the circular-ones property
Andrew R. Curtis,Min Chih Lin,Ross M. McConnell,Yahav Nussbaum,Francisco J. Soulignac,Jeremy P. Spinrad,Jayme Luiz Szwarcfiter +6 more
TL;DR: In this article, a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property is presented, which is similar to the algorithm for interval graphs of Lueker and Booth, but works on PC trees, rather than with PQ trees, which are rooted.
Book ChapterDOI
Characterizations and linear time recognition of helly circular-arc graphs
TL;DR: In this article, the authors describe different characterizations for Helly circular-arc graphs, including a characterization by forbidden induced subgraphs for the class, leading to a linear time recognition algorithm for recognizing graphs of this class.
Posted Content
Isomorphism of graph classes related to the circular-ones property
Andrew R. Curtis,Min Chih Lin,Ross M. McConnell,Yahav Nussbaum,Francisco J. Soulignac,Jeremy P. Spinrad,Jayme Luiz Szwarcfiter +6 more
TL;DR: This work gives a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property, which leads tolinear-time isomorphic algorithms for related graph classes, including Helly circular-arc graphs, Γ circular- Arc graphs, proper circular-Arc graphs and convex-round graphs.