Login
Lupa
First page / Show document

Show document Help

A- | A+ | Print
Title:Shellings from relative shellings, with an application to NP-completeness
Authors:ID Santamaría-Galvis, Andrés (Author)
ID Woodroofe, Russell Stephen (Author)
Files:URL https://link.springer.com/article/10.1007%2Fs00454-020-00273-1
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
Keywords:shellability, computational complexity, simplicial complex
Year of publishing:2021
Number of pages:str. 792-807
Numbering:Vol. 66, iss. 2
PID:20.500.12556/RUP-16969 This link opens in a new window
UDC:514
ISSN on article:0179-5376
DOI:10.1007/s00454-020-00273-1 This link opens in a new window
COBISS.SI-ID:73798659 This link opens in a new window
Publication date in RUP:18.10.2021
Views:923
Downloads:22
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 & computational geometry
Shortened title:Discrete comput. geom.
Publisher:Springer
ISSN:0179-5376
COBISS.SI-ID:25342208 This link opens in a new window

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