Lupa

Show document Help

A- | A+ | Print
Title:The recognition problem of graph search trees read more
Authors:ID Beisegel, Jesse (Author)
ID Denkert, Carolin (Author)
ID Köhler, Ekkehard (Author)
ID Krnc, Matjaž (Author)
ID Pivač, Nevena (Author)
ID Scheffler, Robert (Author)
ID Strehler, Martin (Author)
Files:URL https://epubs.siam.org/doi/10.1137/20M1313301
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
Keywords:search tree recognition, LBFS, LDFS, MNS, MCS, chordal graphs
Year of publishing:2021
Number of pages:str. 1418-1446
Numbering:Vol. 35, no. 2
PID:20.500.12556/RUP-17009 This link opens in a new window
UDC:519.17
ISSN on article:0895-4801
DOI:10.1137/20M1313301 This link opens in a new window
COBISS.SI-ID:80433667 This link opens in a new window
Publication date in RUP:18.10.2021
Views:1767
Downloads:26
Metadata:XML 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:SIAM journal on discrete mathematics
Shortened title:SIAM j. discrete math.
Publisher:SIAM
ISSN:0895-4801
COBISS.SI-ID:26388736 This link opens in a new window

Secondary language

Language:English
Keywords:prepoznavanje iskalnih dreves, LBFS, LDFS, MNS, MCS, tetivni grafi


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