Restricting circular-arc representations so as to have no three or fewer arcs cover the entire circle and to have the endpoints of arcs be distinguishable by ...
Restricting circular-arc representations so as to have no three or fewer arcs cover the entire circle and to have the endpoints of arcs be distinguishable by ...
Restricting circular-arc representations so as to have no three or fewer arcs cover the entire circle and to have the endpoints of arcs be distinguishable by ...
Restricting circular-arc representations so as to have no three or fewer arcs cover the entire circle and to have the endpoints of arcs be distinguishable by ...
A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the ...
Also, we describe efficient algorithms for finding a maximum independent set, a minimum covering by cliques and a maximum clique of a circular-arc graph. 1.
An algorithm is presented that, given the intersection model S of a circular-arc graph G with n vertices and m edges, finds a maximum-sized clique of G in ...
Missing: Restricted cycles.
Mar 4, 2024 · Abstract. The most elusive problem around the class of circular-arc graphs is identifying all mini- mal graphs that are not in this class.
Dec 8, 2008 · Abstract. In this paper we address the problem of finding all maximal cliques in a subclass of circular-arc graphs.
Missing: Restricted | Show results with:Restricted
Circle graphs and circular-arc graphs are the intersection graphs of chords and arcs in a circle. In this paper we present algorithms for finding maximum ...
Missing: Restricted cycles.