Lupa

Show document Help

A- | A+ | Print
Title:On the end-vertex problem of graph searches
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://dmtcs.episciences.org/5572
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
Keywords:end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph classes
Year of publishing:2019
Number of pages:str. 1-20
Numbering:#Vol. #21, #no. #1
PID:20.500.12556/RUP-11894 This link opens in a new window
UDC:519.17
ISSN on article:1365-8050
COBISS.SI-ID:1541461444 This link opens in a new window
Publication date in RUP:22.08.2019
Views:1913
Downloads:48
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:Discrete mathematics and theoretical computer science
Shortened title:Discret. math. theor. comput. sci.
Publisher:Assoc. Discrete Math. Theor. Comput. Sci.
ISSN:1365-8050
COBISS.SI-ID:8089433 This link opens in a new window

Secondary language

Language:English
Keywords:končno vozlišče, grafovsko iskanje, iskanje maksimalne kardinalnosti, iskanje maksimalne soseščine, grafovske družine


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