Login
Lupa
First page / Show document

Show document Help

A- | A+ | Print
Title:Strong cliques in diamond-free graphs
Authors:ID Chiarelli, Nina (Author)
ID Martínez-Barona, Berenice (Author)
ID Milanič, Martin (Author)
ID Monnot, Jérôme (Author)
ID Muršič, Peter (Author)
Files:URL https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_21
 
Language:English
Work type:Unknown
Typology:1.08 - Published Scientific Conference Contribution
Organization:IAM - Andrej Marušič Institute
Keywords:maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal property
Year of publishing:2020
Number of pages:Str. 261-273
PID:20.500.12556/RUP-14263 This link opens in a new window
UDC:519.17:004
ISSN on article:0302-9743
DOI:10.1007/978-3-030-60440-0_21 This link opens in a new window
COBISS.SI-ID:36185859 This link opens in a new window
Publication date in RUP:10.11.2020
Views:2295
Downloads:59
Metadata:XML DC-XML DC-RDF
:
CHIARELLI, Nina, MARTÍNEZ-BARONA, Berenice, MILANIČ, Martin, MONNOT, Jérôme and MURŠIČ, Peter, 2020, Strong cliques in diamond-free graphs. In : Graph-theoretic concepts in computer science [online]. Published Scientific Conference Contribution. 2020. p. 261–273. [Accessed 5 April 2025]. Retrieved from: https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_21
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: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 proceedings

Title:Graph-theoretic concepts in computer science
COBISS.SI-ID:36184067 This link opens in a new window

Record is a part of a journal

Title:Lecture notes in computer science
Shortened title:Lect. notes comput. sci.
Publisher:Springer
ISSN:0302-9743
COBISS.SI-ID:4292374 This link opens in a new window

Secondary language

Language:English
Keywords:maksimalna klika, maksimalna neodvisna množica, graf brez diamantov, krepka klika, simplicialna klika, CIS graf, NP-težek problem, algoritem linearne časovne zahtevnosti, lastnost Erdősa in Hajnala


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