Results 241 to 250 of about 4,514 (260)
Some of the next articles are maybe not open access.
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
Minimum Fill-in on Circle and Circular-Arc Graphs
Journal of Algorithms, 1996Summary: We described elegant and efficient algorithms for solving the MINIMUM FILL-IN problem on circle graphs and circular-arc graphs, which are based on representation theorems for the minimal triangulations of such graphs. Representation theorems of this type are powerful tools for designing treewidth and minimum fill-in algorithms.
Kloks, T., Kratsch, D., Wong, C.K.
openaire +2 more sources
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
Unit Circular-Arc Graph Representations and Feasible Circulations
SIAM Journal on Discrete Mathematics, 2008Min Chih Lin, Jayme L Szwarcfiter
exaly
Maximum weight independent set of circular-arc graph and its application
Journal of Applied Mathematics and Computing, 2006Madhumangal Pal, Pal Madhumangal
exaly
Circular‐Arc Bigraphs and Its Subclasses
Journal of Graph Theory, 2013Sandip Das, Shamik Ghosh
exaly
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics, 2009Haim Kaplan, Yahav Nussbaum
exaly
An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph
Journal of Computer and Communications, 2016Yoko Nakajima
exaly