Results 231 to 240 of about 3,311 (246)
Some of the next articles are maybe not open access.
Efficient algorithms for interval graphs and circular‐arc graphs
Networks, 1982AbstractWe show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in O(n log n) time [O(n) time if the endpoints of the intervals are sorted].
Udaiprakash I. Gupta +2 more
openaire +2 more sources
k Best Cuts for Circular-Arc graphs
Algorithmica, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kuo-Hui Tsai, D. T. Lee
openaire +1 more source
NC algorithms for circular-arc graphs
1989Circular-arc graphs are an important class of intersection graphs. They have been applied to problems in genetics [17], traffic control [18], multidimensional scaling [11], computer compiler design [22], characterization of a certain class of lattices [19], and some other areas [13] [23].
openaire +1 more source
On Roman domination of circular-arc graphs
International Journal of Advanced Intelligence Paradigms, 2018Akul Rana, Angshu Kumar Sinha, Anita Pal
openaire +1 more source
Normal Helly circular-arc graphs and its subclasses
Discrete Applied Mathematics, 2013Min Chih Lin +2 more
exaly
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing, 1996Xiaotie Deng, Pavol Hell
exaly
Partial characterizations of circular‐arc graphs
Journal of Graph Theory, 2009Flavia Bonomo +2 more
exaly
Linear-Time Recognition of Helly Circular-Arc Models and Graphs
Algorithmica, 2009Min Chih Lin +2 more
exaly
Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection
Discrete Applied Mathematics, 2017Yixin Cao +2 more
exaly