Results 121 to 125 of about 438 (125)
Some of the next articles are maybe not open access.
Applied Mathematics and Computation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
He Chen, Zemin Jin
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
He Chen, Zemin Jin
openaire +2 more sources
Linear-Time Minimal Cograph Editing
2021We present an algorithm for computing a minimal editing of an arbitrary graph G into a cograph, i.e. a set of edits (additions and deletions of edges) that turns G into a cograph and that is minimal for inclusion. Our algorithm runs in linear time in the size of the input graph, that is \(O(n+m)\) time where n and m are the number of vertices and the ...
openaire +1 more source
Fast parallel algorithms for cographs
1990In this paper we propose a new way of looking at cographs and show how it affords us a fast parallel recognition algorithm. Additionally, should the graph under investigation be a cograph, our algorithm constructs its unique tree representation. Next, given a cograph along with its tree representation we obtain a fast parallel coloring algorithm ...
R. Lin, S. Olariu
openaire +1 more source