[HTML][HTML] Graph-based data clustering with overlaps
We introduce overlap cluster graph modification problems where, other than in most
previous works, the clusters of the target graph may overlap. More precisely, the studied …
previous works, the clusters of the target graph may overlap. More precisely, the studied …
Arboricity, h-index, and dynamic algorithms
We propose a new data structure for manipulating graphs, called h-graph, which is
particularly suited for designing dynamic algorithms. The structure itself is simple, consisting …
particularly suited for designing dynamic algorithms. The structure itself is simple, consisting …
[PDF][PDF] Some combinatorial optimization problems for weak-bisplit graphs
There exists linear algorithms to recognize weak-bisplit graphs and NP-complete
optimization problems are efficiently resolved for this class of graphs. In this paper, using …
optimization problems are efficiently resolved for this class of graphs. In this paper, using …
Recognition and combinatorial optimization algorithms for bipartite chain graphs
In this paper we give a recognition algorithm in O (n (n+ m)) time for bipartite chain graphs,
and directly calculate the density of such graphs. For their stability number and domination …
and directly calculate the density of such graphs. For their stability number and domination …
[DOC][DOC] A Recognition Algorithm for a Class of Partitionable Graphs that Satisfies the Normal Graph Conjecture
A graph is normal if admits a clique cover and a stable set cover such that every clique
intersects every stable set. The Normal Graph Conjecture says that every {,,}-free graph is …
intersects every stable set. The Normal Graph Conjecture says that every {,,}-free graph is …
On the min-max 2-cluster editing problem
In this paper, we study the problem Min-Max 2-Cluster Editing which asks for a modification
of a given graph into two maximal cliques by inserting or deleting edges such that the …
of a given graph into two maximal cliques by inserting or deleting edges such that the …
[PDF][PDF] Fast algorithms of dually chordal graphs
”Vasile Alecsandri” University of Bacau Faculty of Sciences Scientific Studies and Research
Series Mathematics and Informa Page 1 ”Vasile Alecsandri” University of Bacau Faculty of …
Series Mathematics and Informa Page 1 ”Vasile Alecsandri” University of Bacau Faculty of …
[كتاب][B] Multivariate algorithmics in biological data analysis
J Uhlmann - 2011 - books.google.com
This thesis covers parts of my research on fixed-parameterized algorithms for NP-hard
problems that arise in the context of biological data analysis. My research was funded by the …
problems that arise in the context of biological data analysis. My research was funded by the …
[PDF][PDF] Algorithms for the Recognition of Net-free Graphs and for Computing Maximum Cardinality Matchings in Claw-free Graphs
During the last decades, numerous studies have been undertaken on the classes of net-free
graphs, claw-free graphs, and the relationship between them. The notion of weakly …
graphs, claw-free graphs, and the relationship between them. The notion of weakly …
On polar, trivially perfect graphs
During the last decades, different types of decompositions have been processed in the field
of graph theory. In various problems, for example in the construction of recognition …
of graph theory. In various problems, for example in the construction of recognition …