Print
Lupa

Show document Help

A- | A+ | Print
Title:On two extensions of equimatchable graphs
Authors:ID Deniz, Zakir (Author)
ID Ekim, Tinaz (Author)
ID Hartinger, Tatiana Romina (Author)
ID Milanič, Martin (Author)
ID Shalom, Mordechai (Author)
Files:URL http://dx.doi.org/10.1016/j.disopt.2017.08.002
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
Keywords:minimum maximal matching, equimatchable graph, edge dominating set, Gallai-Edmonds decomposition, parameterized complexity
Year of publishing:2017
Number of pages:str. 112-130
Numbering:#Vol. #26
PID:20.500.12556/RUP-9454 This link opens in a new window
UDC:519.17
ISSN on article:1572-5286
DOI:10.1016/j.disopt.2017.08.002 This link opens in a new window
COBISS.SI-ID:1540044996 This link opens in a new window
Publication date in RUP:29.01.2018
Views:2133
Downloads:146
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for 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.

Record is a part of a journal

Title:Discrete optimization
Publisher:Elsevier
ISSN:1572-5286
COBISS.SI-ID:513620761 This link opens in a new window

Secondary language

Language:English
Keywords:najmanjše maksimalno prirejanje, graf enako velikih maksimalnih prirejanj, povezavno dominantna množica, Gallai-Edmondsova dekompozicija, parameterizirana računska zahtevnost


Comments

Leave comment

You must 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