Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Lexicographic_breadth-first_search> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items per page.
- Lexicographic_breadth-first_search abstract "In computer science, lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph. The algorithm is different from breadth first search, but it produces an ordering that is consistent with breadth-first search.The lexicographic breadth-first search algorithm is based on the idea of partition refinement and was first developed by Donald J. Rose, Robert E. Tarjan, and George S. Lueker (1976). A more detailed survey of the topic is presented by Corneil (2004).It has been used as a subroutine in other graph algorithms including the recognition of chordal graphs, and optimal coloring of distance-hereditary graphs.".
- Lexicographic_breadth-first_search wikiPageExternalLink cograph.ps.
- Lexicographic_breadth-first_search wikiPageID "22336498".
- Lexicographic_breadth-first_search wikiPageRevisionID "581598754".
- Lexicographic_breadth-first_search author2Link "Robert Tarjan".
- Lexicographic_breadth-first_search first "Donald J.".
- Lexicographic_breadth-first_search first "George S.".
- Lexicographic_breadth-first_search first "Robert E.".
- Lexicographic_breadth-first_search hasPhotoCollection Lexicographic_breadth-first_search.
- Lexicographic_breadth-first_search last "Lueker".
- Lexicographic_breadth-first_search last "Rose".
- Lexicographic_breadth-first_search last "Tarjan".
- Lexicographic_breadth-first_search year "1976".
- Lexicographic_breadth-first_search subject Category:Graph_algorithms.
- Lexicographic_breadth-first_search subject Category:Search_algorithms.
- Lexicographic_breadth-first_search type Abstraction100002137.
- Lexicographic_breadth-first_search type Act100030358.
- Lexicographic_breadth-first_search type Activity100407535.
- Lexicographic_breadth-first_search type Algorithm105847438.
- Lexicographic_breadth-first_search type Event100029378.
- Lexicographic_breadth-first_search type GraphAlgorithms.
- Lexicographic_breadth-first_search type Procedure101023820.
- Lexicographic_breadth-first_search type PsychologicalFeature100023100.
- Lexicographic_breadth-first_search type Rule105846932.
- Lexicographic_breadth-first_search type SearchAlgorithms.
- Lexicographic_breadth-first_search type YagoPermanentlyLocatedEntity.
- Lexicographic_breadth-first_search comment "In computer science, lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph. The algorithm is different from breadth first search, but it produces an ordering that is consistent with breadth-first search.The lexicographic breadth-first search algorithm is based on the idea of partition refinement and was first developed by Donald J. Rose, Robert E. Tarjan, and George S. Lueker (1976).".
- Lexicographic_breadth-first_search label "Lexicographic breadth-first search".
- Lexicographic_breadth-first_search sameAs m.05t0f15.
- Lexicographic_breadth-first_search sameAs Q6504471.
- Lexicographic_breadth-first_search sameAs Q6504471.
- Lexicographic_breadth-first_search sameAs Lexicographic_breadth-first_search.
- Lexicographic_breadth-first_search wasDerivedFrom Lexicographic_breadth-first_search?oldid=581598754.
- Lexicographic_breadth-first_search isPrimaryTopicOf Lexicographic_breadth-first_search.