Vector connectivity in graphs

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Vector connectivity in graphs
Authors:	ID Milanič, Martin (Author) ID Boros, Endre (Author) ID Cicalese, Ferdinando (Author) ID Heggernes, Pinar (Author) ID Van 't Hof, Pim (Author) ID Rizzi, Romeo (Author)
Files:	http://drops.dagstuhl.de/opus/volltexte/2014/4597/pdf/dagrep-v004-i002-complete.pdf
Language:	English
Work type:	Not categorized
Typology:	1.10 - Published Scientific Conference Contribution Abstract (invited lecture)
Organization:	IAM - Andrej Marušič Institute
Keywords:	vektorska povezanost, aproksimacijski algoritmi, polinomski algoritmi, NP-poln problem, razcepljeni grafi, kografi, drevesa, vector connectivity, approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees
Year of publishing:	2014
Number of pages:	str. 48-49
Numbering:	Vol. 4, iss. 2
PID:	20.500.12556/RUP-7156
ISSN:	2192-5283
UDC:	519.17
DOI:	10.4230/DagRep.4.2.38
COBISS.SI-ID:	1537132484
Publication date in RUP:	15.10.2015
Views:	4078
Downloads:	287
Metadata:
:	MILANIČ, Martin, BOROS, Endre, CICALESE, Ferdinando, HEGGERNES, Pinar, VAN ’T HOF, Pim and RIZZI, Romeo, 2014, Vector connectivity in graphs. In : [online]. Published Scientific Conference Contribution Abstract (invited lecture). 2014. p. 48–49. [Accessed 5 April 2025]. Retrieved from: http://drops.dagstuhl.de/opus/volltexte/2014/4597/pdf/dagrep-v004-i002-complete.pdf Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

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

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back