SemOpenAlex |

SemOpenAlex

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1564479627> ?p ?o ?g. }

Showing items 1 to 55 of 55 with 100 items per page.

W1564479627 endingPage "35" @default.
W1564479627 startingPage "20" @default.
W1564479627 abstract "Many applications, like the retrieval of information from the WWW, require or are improved by the detection of sets of closely related vertices in graphs. Depending on the application, many approaches are possible. In this paper we present a purely graph-theoretical approach, independent of the represented data. Based on the edge-connectivity of subgraphs, a tree of subgraphs is constructed, such that the children of a node are pairwise disjoint and contained in their parent. We describe a polynomial algorithm for the construction of the tree and present two efficient methods for the handling of dangling links vertices of low degree, constructing the correct result in significantly decreased time. Furthermore we give a short description of possible applications in the fields of information retrieval, clustering and graph drawing." @default.
W1564479627 created "2016-06-24" @default.
W1564479627 creator A5063703251 @default.
W1564479627 date "2003-01-01" @default.
W1564479627 modified "2023-10-16" @default.
W1564479627 title "Communities in Graphs" @default.
W1564479627 cites W1567692704 @default.
W1564479627 cites W1977001629 @default.
W1564479627 cites W1983465613 @default.
W1564479627 cites W1984374364 @default.
W1564479627 cites W2008620264 @default.
W1564479627 cites W2020423193 @default.
W1564479627 cites W2026875114 @default.
W1564479627 cites W2035228443 @default.
W1564479627 cites W2054145937 @default.
W1564479627 cites W2065183358 @default.
W1564479627 cites W2075900721 @default.
W1564479627 cites W2082398795 @default.
W1564479627 cites W2117495845 @default.
W1564479627 cites W2769133055 @default.
W1564479627 cites W29385459 @default.
W1564479627 cites W4240407914 @default.
W1564479627 doi "https://doi.org/10.1007/978-3-540-39884-4_3" @default.
W1564479627 hasPublicationYear "2003" @default.
W1564479627 type Work @default.
W1564479627 sameAs 1564479627 @default.
W1564479627 citedByCount "13" @default.
W1564479627 countsByYear W15644796272014 @default.
W1564479627 crossrefType "book-chapter" @default.
W1564479627 hasAuthorship W1564479627A5063703251 @default.
W1564479627 hasConcept C144024400 @default.
W1564479627 hasConcept C205649164 @default.
W1564479627 hasConcept C41008148 @default.
W1564479627 hasConceptScore W1564479627C144024400 @default.
W1564479627 hasConceptScore W1564479627C205649164 @default.
W1564479627 hasConceptScore W1564479627C41008148 @default.
W1564479627 hasLocation W15644796271 @default.
W1564479627 hasOpenAccess W1564479627 @default.
W1564479627 hasPrimaryLocation W15644796271 @default.
W1564479627 hasRelatedWork W2093578348 @default.
W1564479627 hasRelatedWork W2350741829 @default.
W1564479627 hasRelatedWork W2358668433 @default.
W1564479627 hasRelatedWork W2376932109 @default.
W1564479627 hasRelatedWork W2382290278 @default.
W1564479627 hasRelatedWork W2390279801 @default.
W1564479627 hasRelatedWork W2748952813 @default.
W1564479627 hasRelatedWork W2766271392 @default.
W1564479627 hasRelatedWork W2899084033 @default.
W1564479627 hasRelatedWork W3004735627 @default.
W1564479627 isParatext "false" @default.
W1564479627 isRetracted "false" @default.
W1564479627 magId "1564479627" @default.
W1564479627 workType "book-chapter" @default.