first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
Authors:
Debashis Bera a;
Madhumangal Pal a;
Tapan Pal a
| Affiliation: | a Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, India. |
DOI:
10.1080/00207160212707
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
79,
Issue
10
2002
, pages 1057
- 1065
International Journal of Computer Mathematics,
Volume
79,
Issue
10
2002
, pages 1057
- 1065
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 11
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
In this paper, to find all maximal cliques of a trapezoid graph a set of intervals have been constructed by projecting the geometrical representation of the graph on the bottom line. The proposed algorithm for this purpose takes O(n2 + yn) time, where n is the number of vertices of the graph and y is the output size.
|
| Keywords: Design And Analysis Of Algorithms; Cliques; Maximal Cliques; Trapezoid Graphs |
| view references (11) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
