Buscar
Mostrando ítems 21-30 de 110
Essential obstacles to Helly circular-arc graphs
(Elsevier Science, 2022-10-30)
A Helly circular-arc graph is the intersection graph of a set of arcs on a circle having the Helly property. We introduce essential obstacles, which are a refinement of the notion of obstacles, and prove that essential ...
The Graph of the Tangent Function
(Louis A. Talman, 2016)
The Graph of the Sine Function
(Louis A. Talman, 2011)
The Graph of the Tangent Function
(Louis A. Talman, 2011)
The Graph of the Sine Function
(Louis A. Talman, 2016)
O problema da inundação em grafos função-circular
(Universidade Tecnológica Federal do ParanáPonta GrossaBrasilDepartamento Acadêmico de InformáticaCiência da ComputaçãoUTFPR, 2016-06-01)
The Flood it Problem aims to determine the smallest number of movements required to convert a colored surface into a monochromatic one. Such surface can be modeled as a graph, where each vertex is a continous monochromatic ...
Enumerating the maximal cliques of a circle graph
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Linear-time recognition of Helly circular-arc models and graphs
(Springer, 2011-02)
A circular-arc model M is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then · is a Helly circular-arc model. A (Helly) circular-arc graph is the intersection graph of a (Helly) ...
De bruijn graph arcs
(2016)
De bruijn graph arcs
(2011)