Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Degeneracy_(graph_theory)> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Degeneracy_(graph_theory) abstract ""K-core" redirects here. The core of a graph is a different concept.In graph theory, a k-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph's edges. The degeneracy of a graph is the smallest value of k for which it is k-degenerate. The degeneracy of a graph is a measure of how sparse it is, and is within a constant factor of other sparsity measures such as the arboricity of a graph.Degeneracy is also known as the k-core number, width, and linkage, and is essentially the same as the coloring number or Szekeres-Wilf number (named after Szekeres & Wilf 1968). k-degenerate graphs have also been called k-inductive graphs. The degeneracy of a graph may be computed in linear time by an algorithm that repeatedly removes minimum-degree vertices. The connected components that are left after all vertices of degree less than k have been removed are called the k-cores of the graph and the degeneracy of a graph is the largest value k such that it has a k-core.".
- Degeneracy_(graph_theory) wikiPageExternalLink j19.pdf.
- Degeneracy_(graph_theory) wikiPageExternalLink core.ps.
- Degeneracy_(graph_theory) wikiPageExternalLink ASGraphDynamicAnalysis.pdf.
- Degeneracy_(graph_theory) wikiPageExternalLink ChrEpp-TCS-91.pdf.
- Degeneracy_(graph_theory) wikiPageExternalLink GIW03P158.pdf.
- Degeneracy_(graph_theory) wikiPageExternalLink EmergenceRandom_Science%20286,%20509-512%20(1999).pdf.
- Degeneracy_(graph_theory) wikiPageExternalLink 1966-07.pdf.
- Degeneracy_(graph_theory) wikiPageExternalLink 1975-26.pdf.
- Degeneracy_(graph_theory) wikiPageExternalLink p1082.
- Degeneracy_(graph_theory) wikiPageID "27545816".
- Degeneracy_(graph_theory) wikiPageRevisionID "582625204".
- Degeneracy_(graph_theory) hasPhotoCollection Degeneracy_(graph_theory).
- Degeneracy_(graph_theory) subject Category:Graph_invariants.
- Degeneracy_(graph_theory) type Abstraction100002137.
- Degeneracy_(graph_theory) type Cognition100023271.
- Degeneracy_(graph_theory) type Concept105835747.
- Degeneracy_(graph_theory) type Content105809192.
- Degeneracy_(graph_theory) type Feature105849789.
- Degeneracy_(graph_theory) type GraphInvariants.
- Degeneracy_(graph_theory) type Idea105833840.
- Degeneracy_(graph_theory) type Invariant105850432.
- Degeneracy_(graph_theory) type Property105849040.
- Degeneracy_(graph_theory) type PsychologicalFeature100023100.
- Degeneracy_(graph_theory) comment ""K-core" redirects here. The core of a graph is a different concept.In graph theory, a k-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph's edges. The degeneracy of a graph is the smallest value of k for which it is k-degenerate.".
- Degeneracy_(graph_theory) label "Degeneracy (graph theory)".
- Degeneracy_(graph_theory) sameAs m.05wbtr.
- Degeneracy_(graph_theory) sameAs Q5251771.
- Degeneracy_(graph_theory) sameAs Q5251771.
- Degeneracy_(graph_theory) sameAs Degeneracy_(graph_theory).
- Degeneracy_(graph_theory) wasDerivedFrom Degeneracy_(graph_theory)?oldid=582625204.
- Degeneracy_(graph_theory) isPrimaryTopicOf Degeneracy_(graph_theory).