Graphs where search methods are indistinguishable

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Graphs where search methods are indistinguishable
Authors:	ID Krnc, Matjaž (Author) ID Pivač, Nevena (Author)
Files:	https://link.springer.com/chapter/10.1007%2F978-3-030-83823-2_55
Language:	English
Work type:	Unknown
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	graph search methods, breadth first search, depth first search
Year of publishing:	2021
Number of pages:	Str. 351-358
PID:	20.500.12556/RUP-17005
UDC:	519.17
ISSN on article:	0302-9743
DOI:	10.1007/978-3-030-83823-2_55
COBISS.SI-ID:	80112131
Publication date in RUP:	18.10.2021
Views:	2355
Downloads:	23
Metadata:
:	KRNC, Matjaž and PIVAČ, Nevena, 2021, Graphs where search methods are indistinguishable. In : Extended Abstracts EuroComb 2021 [online]. Published Scientific Conference Contribution. 2021. p. 351–358. [Accessed 16 March 2025]. Retrieved from: https://link.springer.com/chapter/10.1007%2F978-3-030-83823-2_55 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:

Similar works from our repository:

Similar works from other repositories:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Extended Abstracts EuroComb 2021
COBISS.SI-ID:	80111107

Language:	English
Keywords:	iskanje na grafih, iskanje v širino, iskanje v globino

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back