Lupa

Show document

A- | A+ | Print
Title:Vector connectivity in graphs
Authors:Cicalese, Ferdinando (Author)
Milanič, Martin (Author)
Heggernes, Pinar (Author)
Boros, Endre (Author)
Van 't Hof, Pim (Author)
Rizzi, Romeo (Author)
Files:URL http://drops.dagstuhl.de/opus/volltexte/2014/4597/pdf/dagrep-v004-i002-complete.pdf
 
Language:English
Work type:Not categorized
Tipology: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
ISSN:2192-5283
UDC:519.17
COBISS_ID:1537132484 Link is opened in a new window
DOI:10.4230/DagRep.4.2.38 Link is opened in a new window
Views:1240
Downloads:88
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
Share:Bookmark and Share

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

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica