Login
Lupa
First page / Show document

Show document Help

A- | A+ | Print
Title:Set graphs. II. Complexity of set graph recognition and similar problems
Authors:ID Milanič, Martin (Author)
ID Rizzi, Romeo (Author)
ID Tomescu, Alexandru I. (Author)
Files:URL http://dx.doi.org/10.1016/j.tcs.2014.06.017
 
Language:English
Work type:Not categorized
Typology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
Keywords:acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code
Year of publishing:2014
Number of pages:str. 70-81
Numbering:Vol. 547
PID:20.500.12556/RUP-7764 This link opens in a new window
ISSN:0304-3975
UDC:519.17
DOI:10.1016/j.tcs.2014.06.017 This link opens in a new window
COBISS.SI-ID:1537143492 This link opens in a new window
Publication date in RUP:03.04.2017
Views:2967
Downloads:135
Metadata:XML DC-XML DC-RDF
:
MILANIČ, Martin, RIZZI, Romeo and TOMESCU, Alexandru I., 2014, Set graphs. II. Complexity of set graph recognition and similar problems. [online]. 2014. Vol. 547, p. 70–81. [Accessed 5 April 2025]. DOI 10.1016/j.tcs.2014.06.017. Retrieved from: http://dx.doi.org/10.1016/j.tcs.2014.06.017
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.

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