Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units
Authors:	ID Trefftz, Christian (Author) ID Santamaría-Galvis, Andrés (Author) ID Cruz Rodes, Roberto (Author)
Files:	https://ieeexplore.ieee.org/document/6871746
Language:	English
Work type:	Unknown
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal clique
Year of publishing:	2014
Number of pages:	Str. 1-3
PID:	20.500.12556/RUP-16998
UDC:	519.17
DOI:	10.1109/EIT.2014.6871746
COBISS.SI-ID:	77690627
Publication date in RUP:	18.10.2021
Views:	1440
Downloads:	24
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	2014 IEEE International Conference on Electro/Information Technology (EIT 2014), Milwaukee, Wisconsin, 5-7 June 2014 : [proceedings]
Place of publishing:	Los Alamitos
Publisher:	IEEE
ISBN:	978-1-4799-4773-7
COBISS.SI-ID:	77688067

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back