Add to ORKGIn this thesis we study two clique-cover problems which have interesting applications regarding the k -bend intersection graph representation: the edge-clique-cover-degree problem and the edge-clique-layered-cover problem. We focus on the complexity of these problems and polynomial time algorithms on restricted classes of graphs. The main results of the thesis are NP-completness of the edge-clique-layered-cover problem and a polynomial-time 2-approximation algorithm on the subclass of diamond-free graphs for the same problem as well as some upper bounds on particular graph classes
AbstractIn this paper we show that the problem of identifying an edge (i,j) of a graph G such that t...
AbstractSubtree filament graphs are the intersection graphs of subtree filaments in a tree. This cla...
Abstract. Intersection graphs of disks and of line segments, respectively, have been well studied, b...
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generaliz...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
We introduce three new complexity parameters that in some sense measure how chordal-like a graph is....
We introduce three new complexity parameters that in some sense measure how chordal-like a graph is....
To cover the edges of a graph with a minimum number of cliques is an NP-complete problem with many a...
The problem of covering edges and vertices in a graph (??or in a hypergraph??) was motivated by a pr...
AbstractA Ki in a graph is a complete subgraph of size i. A Ki-cover of a graph G(V, E is a set C of...
Graphs and AlgorithmsA graph class has few cliques if there is a polynomial bound on the number of m...
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contai...
AbstractIn this paper we show that the problem of identifying an edge (i,j) of a graph G such that t...
AbstractSubtree filament graphs are the intersection graphs of subtree filaments in a tree. This cla...
Abstract. Intersection graphs of disks and of line segments, respectively, have been well studied, b...
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generaliz...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a proble...
We introduce three new complexity parameters that in some sense measure how chordal-like a graph is....
We introduce three new complexity parameters that in some sense measure how chordal-like a graph is....
To cover the edges of a graph with a minimum number of cliques is an NP-complete problem with many a...
The problem of covering edges and vertices in a graph (??or in a hypergraph??) was motivated by a pr...
AbstractA Ki in a graph is a complete subgraph of size i. A Ki-cover of a graph G(V, E is a set C of...
Graphs and AlgorithmsA graph class has few cliques if there is a polynomial bound on the number of m...
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contai...
AbstractIn this paper we show that the problem of identifying an edge (i,j) of a graph G such that t...
AbstractSubtree filament graphs are the intersection graphs of subtree filaments in a tree. This cla...
Abstract. Intersection graphs of disks and of line segments, respectively, have been well studied, b...