Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dense_subgraph> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Dense_subgraph abstract "In computer science the notion of highly connected subgraphs appears frequently. This notion can be formalized as follows. Let be an undirected graph and let be a subgraph of . Then the density of is defined to be .The densest subgraph problem is that of finding a subgraph of maximum density. In 1984, Andrew V. Goldberg developed a polynomial time algorithm to find the maximum density subgraph using a max flow technique.".
- Dense_subgraph thumbnail Dense_subgraph.png?width=300.
- Dense_subgraph wikiPageID "32498620".
- Dense_subgraph wikiPageRevisionID "597992134".
- Dense_subgraph hasPhotoCollection Dense_subgraph.
- Dense_subgraph subject Category:Graph_theory.
- Dense_subgraph comment "In computer science the notion of highly connected subgraphs appears frequently. This notion can be formalized as follows. Let be an undirected graph and let be a subgraph of . Then the density of is defined to be .The densest subgraph problem is that of finding a subgraph of maximum density. In 1984, Andrew V. Goldberg developed a polynomial time algorithm to find the maximum density subgraph using a max flow technique.".
- Dense_subgraph label "Dense subgraph".
- Dense_subgraph sameAs m.0h66dhr.
- Dense_subgraph sameAs Q5259307.
- Dense_subgraph sameAs Q5259307.
- Dense_subgraph wasDerivedFrom Dense_subgraph?oldid=597992134.
- Dense_subgraph depiction Dense_subgraph.png.
- Dense_subgraph isPrimaryTopicOf Dense_subgraph.
