Searching for authors named "Leonidas Palios" – sorted by Relevance.
15 documents found, showing 1 through 10.
Next 10 →
-
Decompositional Problems in Computational Geometry
- …gions.c 3 regionadelete() triangulate.c 6 regionainsert() triangulate.c 6 reglistaprint() regions.c 1 regtreeaprint() regions.c 1 repair() pullaoff.c 4 report() fence.c 2 reporta4hedra() main.c 3 rightarotate() regions.c 3 segacompare() utils.c 1 segalineaclip() utils.c 4 segaprint() shat…
- Cited by 1 (0 self) – Add To MetaCart
-
An Efficient Shape-Based Approach to Image Retrieval
- …We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, digital libraries, digital film databases, environmental sciences, and satellite image repositories. We present an effici…
- Cited by 2 (1 self) – Add To MetaCart
-
On the Recognition of P_4-comparability Graphs
- …We consider the problem of recognizing whether a simple undirected graph is a P_4-comparability graph. This problem has been considered by Hoàng and Reed who described an O(n^4)-time algorithm for its solution, where n is the number of vertices of the given graph. Faster algorithms have recently bee…
- Cited by 3 (2 self) – Add To MetaCart
-
Recognizing Bipolarizable and P_4-simplicial Graphs
- …Hoang and Reed de ned the classes of Raspail (also known as Bipolarizable) and P4 -simplicial graphs, both of which are perfectly orderable, and proved that they admit polynomial-time recognition algorithms [16]. In this paper, we consider the recognition problem on these classes of graphs and …
- Cited by 1 (1 self) – Add To MetaCart
-
Hole and Antihole Detection in Graphs
- …In this paper, we study the problems of detecting holes and antiholes in general undirected graphs and present algorithms for them, which, for a graph on n vertices and m edges, run in O(n + m²) time and require O(nm) space; we thus provide a solution to the open problem posed by Hayward, Spinrad, a…
- Cited by 6 (3 self) – Add To MetaCart
-
Recognizing HHD-free and Welsh-Powell Opposition Graphs
- …In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPOgraphs) . In particular, we prove properties and show that a modified version of the classic linear-time algorithm for testing for a …
- Cited by 2 (2 self) – Add To MetaCart
-
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
- …In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHDfree, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic lin…
- Cited by 1 (1 self) – Add To MetaCart
-
An O(nm)-time Certifying Algorithm for Recognizing HHD-free Graphs
- …In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph isomorphic to a house, a hole, or a domino. We prove properties of the HHD-free graphs which enable us to present an O(n m)-…
- Add To MetaCart
-
Adding an edge in a cograph
- …Abstract. In this paper, we establish structural properties of cographs which enable us to present an algorithm which, for a cograph G and anon-edgexy (i.e., two non-adjacent vertices x and y) ofG, finds the minimum number of edges that need to be added to the edge set of G such that the resulting g…
- Cited by 7 (0 self) – Add To MetaCart
-
Recognition and Orientation Algorithms for P_4-comparability Graphs
- …We consider two problems pertaining to P_4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P_4-comparability graph and the problem of producing an acyclic P_4-transitive orientation of a P_4-comparability graph. These problems have been considered by H…
- Cited by 5 (5 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
