Parallelizing an algorithm to decide if a bipartite graph is shellable

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Parallelizing an algorithm to decide if a bipartite graph is shellable
Authors:	ID Santamaría-Galvis, Andrés (Author) ID Cruz Rodes, Roberto (Author) ID Trefftz, Christian (Author) ID Branch, John W. (Author)
Files:	https://ieeexplore.ieee.org/document/6632658
Language:	English
Work type:	Unknown
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	graph theory, parallel algorithms, shellability
Year of publishing:	2013
Number of pages:	Str. 1-3
PID:	20.500.12556/RUP-16999
UDC:	519.17
DOI:	10.1109/EIT.2013.6632658
COBISS.SI-ID:	77677827
Publication date in RUP:	18.10.2021
Views:	1538
Downloads:	23
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:	2013 IEEE International Conference on Electro/Information Technology (EIT 2013), Rapid City, South Dakota, 9-11 May 2013 : [proceedings]
Place of publishing:	Los Alamitos
Publisher:	IEEE
ISBN:	978-1-4673-5208-6
COBISS.SI-ID:	77676035

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back