Vertex cover at distance on H-free graphs

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Vertex cover at distance on H-free graphs
Authors:	ID Dallard, Clément Jean (Author) ID Krbezlija, Mirza (Author) ID Milanič, Martin (Author)
Files:	https://link.springer.com/chapter/10.1007%2F978-3-030-79987-8_17
Language:	English
Work type:	Unknown
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomy
Year of publishing:	2021
Number of pages:	Str. 237-251
PID:	20.500.12556/RUP-16784
UDC:	519.17
ISSN on article:	0302-9743
DOI:	10.1007/978-3-030-79987-8_17
COBISS.SI-ID:	69936899
Publication date in RUP:	16.07.2021
Views:	2661
Downloads:	32
Metadata:
:	DALLARD, Clément Jean, KRBEZLIJA, Mirza and MILANIČ, Martin, 2021, Vertex cover at distance on H-free graphs. In : Combinatorial algorithms [online]. Published Scientific Conference Contribution. 2021. p. 237–251. [Accessed 5 April 2025]. Retrieved from: https://link.springer.com/chapter/10.1007%2F978-3-030-79987-8_17 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:

Searching for similar works... Please wait....

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

Title:	Combinatorial algorithms
COBISS.SI-ID:	69934851

Title:	Lecture notes in computer science
Shortened title:	Lect. notes comput. sci.
Publisher:	Springer
ISSN:	0302-9743
COBISS.SI-ID:	4292374

Language:	English
Keywords:	k-razdaljno točkovno pokritje, H-prost graf, NP-polnost, polinomski algoritem, dihotomija

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back