Matches in SemOpenAlex for { <https://semopenalex.org/work/W626517032> ?p ?o ?g. }
Showing items 1 to 60 of
60
with 100 items per page.
- W626517032 abstract "This chapter introduces a variety of classical finite graph algorithms, such as are taught in upper level computer science classes, together with an analysis of their complexity. It starts with the formal definition and classification of graphs. Then it discussed implementation details and a C++ graph class example. Breadth-first and depth-first traversals are discussed and an application to counting the connected components of a graph is provided. Then Dijkstra’s algorithm is introduced, followed by Kruskal’s and Prim’s. The problems of topological sorting and maximum flow are discussed. Finally, special tours such as Hamiltonian are discussed, as well as their feasibility." @default.
- W626517032 created "2016-06-24" @default.
- W626517032 creator A5036371765 @default.
- W626517032 creator A5078946429 @default.
- W626517032 date "2014-01-01" @default.
- W626517032 modified "2023-09-27" @default.
- W626517032 title "Finite Graph Algorithms" @default.
- W626517032 doi "https://doi.org/10.1007/978-3-319-09888-3_7" @default.
- W626517032 hasPublicationYear "2014" @default.
- W626517032 type Work @default.
- W626517032 sameAs 626517032 @default.
- W626517032 citedByCount "0" @default.
- W626517032 crossrefType "book-chapter" @default.
- W626517032 hasAuthorship W626517032A5036371765 @default.
- W626517032 hasAuthorship W626517032A5078946429 @default.
- W626517032 hasConcept C11413529 @default.
- W626517032 hasConcept C114614502 @default.
- W626517032 hasConcept C118615104 @default.
- W626517032 hasConcept C132525143 @default.
- W626517032 hasConcept C173870130 @default.
- W626517032 hasConcept C22590252 @default.
- W626517032 hasConcept C33923547 @default.
- W626517032 hasConcept C41008148 @default.
- W626517032 hasConcept C80444323 @default.
- W626517032 hasConceptScore W626517032C11413529 @default.
- W626517032 hasConceptScore W626517032C114614502 @default.
- W626517032 hasConceptScore W626517032C118615104 @default.
- W626517032 hasConceptScore W626517032C132525143 @default.
- W626517032 hasConceptScore W626517032C173870130 @default.
- W626517032 hasConceptScore W626517032C22590252 @default.
- W626517032 hasConceptScore W626517032C33923547 @default.
- W626517032 hasConceptScore W626517032C41008148 @default.
- W626517032 hasConceptScore W626517032C80444323 @default.
- W626517032 hasLocation W6265170321 @default.
- W626517032 hasOpenAccess W626517032 @default.
- W626517032 hasPrimaryLocation W6265170321 @default.
- W626517032 hasRelatedWork W1483612403 @default.
- W626517032 hasRelatedWork W1516977005 @default.
- W626517032 hasRelatedWork W1529545264 @default.
- W626517032 hasRelatedWork W1553747859 @default.
- W626517032 hasRelatedWork W1583852878 @default.
- W626517032 hasRelatedWork W1596754947 @default.
- W626517032 hasRelatedWork W1890074740 @default.
- W626517032 hasRelatedWork W2002190731 @default.
- W626517032 hasRelatedWork W2016983303 @default.
- W626517032 hasRelatedWork W2039453926 @default.
- W626517032 hasRelatedWork W2119448807 @default.
- W626517032 hasRelatedWork W2132809233 @default.
- W626517032 hasRelatedWork W2153794890 @default.
- W626517032 hasRelatedWork W2186663447 @default.
- W626517032 hasRelatedWork W2275468787 @default.
- W626517032 hasRelatedWork W2282219474 @default.
- W626517032 hasRelatedWork W2479031364 @default.
- W626517032 hasRelatedWork W2479783738 @default.
- W626517032 hasRelatedWork W279719473 @default.
- W626517032 hasRelatedWork W640456369 @default.
- W626517032 isParatext "false" @default.
- W626517032 isRetracted "false" @default.
- W626517032 magId "626517032" @default.
- W626517032 workType "book-chapter" @default.