11 Result(s)
-
Chapter and Conference Paper
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to ...
-
Chapter and Conference Paper
Finding Geometric Representations of Apex Graphs is NP-Hard
Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin & Gonçalves, SODA 2009), L-shapes (Gonçalves et a...
-
Chapter and Conference Paper
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
In this paper, we study the computational complexity of s -Club Cluster Vertex Deletion. Given a graph, s -Club Cluster Vertex Deletion (s -CVD) aims to delete the minimum number of vertices from the graph so th...
-
Chapter and Conference Paper
Algorithms and Complexity of s-Club Cluster Vertex Deletion
An s-club is a graph which has diameter at most s. Let G be a graph. A set of vertices \(D\subseteq V(G)\) ...
-
Article
On the Stab Number of Rectangle Intersection Graphs
We introduce the notion of stab number and exact stab number of rectangle intersection graphs, otherwise known as graphs of boxicity at most 2. A graph G is said to be a k-stabbable rectangle intersection graph, ...
-
Article
Bounds on the Bend Number of Split and Cocomparability Graphs
A path is a simple, piecewise linear curve made up of alternating horizontal and vertical line segments in the plane. A k-bend path is a path made up of at most k + 1 line segments. A Bk-VPG representation of a g...
-
Chapter and Conference Paper
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line
A graph \(G = (V, E)\) is called a rectangle overlap graph if there is a bijection between V and a set ...
-
Chapter and Conference Paper
On Rectangle Intersection Graphs with Stab Number at Most Two
Rectangle intersection graphs are the intersection graphs of axis-parallel rectangles in the plane. A graph G is said to be a k-stabbable rectangle intersection graph, or k-SRIG for short, if it has a rectangle i...
-
Article
Frame selection for OCR from video stream of book flip**
Optical Character Recognition (OCR) in video stream of flip** pages is a challenging task because flip** at random speed causes difficulties in identifying the frames that contain the open page image (OPI)...
-
Chapter and Conference Paper
On Local Structures of Cubicity 2 Graphs
A 2-stab unit interval graph (2SUIG) is an axes-parallel unit square intersection graph where the unit squares intersect either of the two fixed lines parallel to the X-axis, distance
-
Chapter and Conference Paper
On a Special Class of Boxicity 2 Graphs
We define and study a class of graphs, called 2-stab interval graphs (2SIG), with boxicity 2 which properly contains the class of interval graphs. A 2SIG is an axes-parallel rectangle intersection graph where ...
