Lupa

Show document

A- | A+ | Print
Title:On the end-vertex problem of graph searches
Authors:Beisegel, Jesse (Author)
Denkert, Carolin (Author)
Köhler, Ekkehard (Author)
Krnc, Matjaž (Author)
Mitrović, Nevena (Author)
Scheffler, Robert (Author)
Strehler, Martin (Author)
Files:URL https://dmtcs.episciences.org/5572
 
Language:English
Work type:Unknown
Tipology: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:#no. #1, #Vol. #21
UDC:519.17
ISSN on article:1365-8050
COBISS_ID:1541461444 Link is opened in a new window
Views:122
Downloads:5
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only to 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 have to 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