Matches in SemOpenAlex for { <https://semopenalex.org/work/W2914622658> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W2914622658 abstract "Graph searching is a simple and widely used technique for exploring the vertices and edges of a graph. A graph search starts by visiting an initial vertex and systematically visits new vertices by iteratively traversing edges incident with a vertex previously visited. The order in which vertices are discovered yields an ordering of the vertices of a graph. Two well-known forms of graph search are Breadth-First Search and Depth-First Search. Recently, two restricted versions of graph search, Lexicographic Breadth-First Search and Maximum Cardinality Search, have been applied to a wide variety of problems. Many of these results rely on simple characterizations of vertex orderings that these algorithms can compute. We find similar characterizations of vertex orderings for all other major graph search paradigms. These simple characterizations give a unified view of graph searching, and lead to the identification of two new search paradigms, Lexicographic Depth-First Search and Maximal Neighborhood Search. To further unify our understanding of graph searching, we introduce a generalized technique called Maximal Label Search to express graph labelling algorithms. We characterize labelling schemes that correspond to each of the major search paradigms using our vertex ordering characterizations. We show that labelling schemes can capture some, but not all, types of graph search on complements of graphs without the need to compute the complement. We illustrate the power of our new characterizations by addressing the problem of finding minimal triangulations of arbitrary graphs. We show that a class of algorithms derived from some of the main graph search paradigms can compute minimal elimination orderings, and show how this generalizes many known results." @default.
- W2914622658 created "2019-02-21" @default.
- W2914622658 creator A5025939259 @default.
- W2914622658 date "2005-01-01" @default.
- W2914622658 modified "2023-09-26" @default.
- W2914622658 title "Graph searching" @default.
- W2914622658 hasPublicationYear "2005" @default.
- W2914622658 type Work @default.
- W2914622658 sameAs 2914622658 @default.
- W2914622658 citedByCount "4" @default.
- W2914622658 countsByYear W29146226582013 @default.
- W2914622658 countsByYear W29146226582015 @default.
- W2914622658 countsByYear W29146226582020 @default.
- W2914622658 crossrefType "journal-article" @default.
- W2914622658 hasAuthorship W2914622658A5025939259 @default.
- W2914622658 hasConcept C114614502 @default.
- W2914622658 hasConcept C118615104 @default.
- W2914622658 hasConcept C132525143 @default.
- W2914622658 hasConcept C149530733 @default.
- W2914622658 hasConcept C159254197 @default.
- W2914622658 hasConcept C168291704 @default.
- W2914622658 hasConcept C17169500 @default.
- W2914622658 hasConcept C203776342 @default.
- W2914622658 hasConcept C22149727 @default.
- W2914622658 hasConcept C33923547 @default.
- W2914622658 hasConcept C41008148 @default.
- W2914622658 hasConcept C80899671 @default.
- W2914622658 hasConceptScore W2914622658C114614502 @default.
- W2914622658 hasConceptScore W2914622658C118615104 @default.
- W2914622658 hasConceptScore W2914622658C132525143 @default.
- W2914622658 hasConceptScore W2914622658C149530733 @default.
- W2914622658 hasConceptScore W2914622658C159254197 @default.
- W2914622658 hasConceptScore W2914622658C168291704 @default.
- W2914622658 hasConceptScore W2914622658C17169500 @default.
- W2914622658 hasConceptScore W2914622658C203776342 @default.
- W2914622658 hasConceptScore W2914622658C22149727 @default.
- W2914622658 hasConceptScore W2914622658C33923547 @default.
- W2914622658 hasConceptScore W2914622658C41008148 @default.
- W2914622658 hasConceptScore W2914622658C80899671 @default.
- W2914622658 hasLocation W29146226581 @default.
- W2914622658 hasOpenAccess W2914622658 @default.
- W2914622658 hasPrimaryLocation W29146226581 @default.
- W2914622658 hasRelatedWork W1480863282 @default.
- W2914622658 hasRelatedWork W1599662850 @default.
- W2914622658 hasRelatedWork W2013497015 @default.
- W2914622658 hasRelatedWork W2085271450 @default.
- W2914622658 hasRelatedWork W2086119402 @default.
- W2914622658 hasRelatedWork W2123966888 @default.
- W2914622658 hasRelatedWork W2317521099 @default.
- W2914622658 hasRelatedWork W2345365639 @default.
- W2914622658 hasRelatedWork W2548595052 @default.
- W2914622658 hasRelatedWork W2743049166 @default.
- W2914622658 hasRelatedWork W2783816954 @default.
- W2914622658 hasRelatedWork W2785873217 @default.
- W2914622658 hasRelatedWork W2791769939 @default.
- W2914622658 hasRelatedWork W2946681422 @default.
- W2914622658 hasRelatedWork W2950884682 @default.
- W2914622658 hasRelatedWork W2963315124 @default.
- W2914622658 hasRelatedWork W3116112683 @default.
- W2914622658 hasRelatedWork W3199112679 @default.
- W2914622658 hasRelatedWork W2186149391 @default.
- W2914622658 hasRelatedWork W3115350520 @default.
- W2914622658 isParatext "false" @default.
- W2914622658 isRetracted "false" @default.
- W2914622658 magId "2914622658" @default.
- W2914622658 workType "article" @default.