Matches in SemOpenAlex for { <https://semopenalex.org/work/W4383477761> ?p ?o ?g. }
Showing items 1 to 55 of
55
with 100 items per page.
- W4383477761 endingPage "5785" @default.
- W4383477761 startingPage "5781" @default.
- W4383477761 abstract "Graphs are basic requirement of research in many fields like electrical circuits, computer networks, Genome sequencing, traffic flow, compiler design and cryptography to name a few. There are three fundamental issues one has to address in respect of an undirected graph. First, given a number of nodes, how many unique degree sequences can be there to handle? Second, out of these unique degree sequences, how many are graphic? And third, how to generate random graphs for a degree sequence? This paper presents working solutions for all these issues. An efficient algorithm to find all unique degree sequences for a given number of nodes is presented. An algorithm based on Havel-Kasami algorithm is presented which is more efficient than Erdos-Gallai algorithm to test the connectivity. Finally, an algorithm to generate random graphs is also presented.a" @default.
- W4383477761 created "2023-07-08" @default.
- W4383477761 creator A5068305708 @default.
- W4383477761 date "2023-01-01" @default.
- W4383477761 modified "2023-09-29" @default.
- W4383477761 title "Finding All Graphic Sequences and Generating Random Graphs" @default.
- W4383477761 doi "https://doi.org/10.35444/ijana.2023.15105" @default.
- W4383477761 hasPublicationYear "2023" @default.
- W4383477761 type Work @default.
- W4383477761 citedByCount "0" @default.
- W4383477761 crossrefType "journal-article" @default.
- W4383477761 hasAuthorship W4383477761A5068305708 @default.
- W4383477761 hasBestOaLocation W43834777611 @default.
- W4383477761 hasConcept C11413529 @default.
- W4383477761 hasConcept C121332964 @default.
- W4383477761 hasConcept C132525143 @default.
- W4383477761 hasConcept C24890656 @default.
- W4383477761 hasConcept C2775997480 @default.
- W4383477761 hasConcept C2778112365 @default.
- W4383477761 hasConcept C41008148 @default.
- W4383477761 hasConcept C47458327 @default.
- W4383477761 hasConcept C54355233 @default.
- W4383477761 hasConcept C80444323 @default.
- W4383477761 hasConcept C86803240 @default.
- W4383477761 hasConceptScore W4383477761C11413529 @default.
- W4383477761 hasConceptScore W4383477761C121332964 @default.
- W4383477761 hasConceptScore W4383477761C132525143 @default.
- W4383477761 hasConceptScore W4383477761C24890656 @default.
- W4383477761 hasConceptScore W4383477761C2775997480 @default.
- W4383477761 hasConceptScore W4383477761C2778112365 @default.
- W4383477761 hasConceptScore W4383477761C41008148 @default.
- W4383477761 hasConceptScore W4383477761C47458327 @default.
- W4383477761 hasConceptScore W4383477761C54355233 @default.
- W4383477761 hasConceptScore W4383477761C80444323 @default.
- W4383477761 hasConceptScore W4383477761C86803240 @default.
- W4383477761 hasIssue "01" @default.
- W4383477761 hasLocation W43834777611 @default.
- W4383477761 hasOpenAccess W4383477761 @default.
- W4383477761 hasPrimaryLocation W43834777611 @default.
- W4383477761 hasRelatedWork W2252305557 @default.
- W4383477761 hasRelatedWork W2608806994 @default.
- W4383477761 hasRelatedWork W2963728051 @default.
- W4383477761 hasRelatedWork W3170428146 @default.
- W4383477761 hasRelatedWork W3214803855 @default.
- W4383477761 hasRelatedWork W4226486935 @default.
- W4383477761 hasRelatedWork W4295093499 @default.
- W4383477761 hasRelatedWork W4299783662 @default.
- W4383477761 hasRelatedWork W4301422383 @default.
- W4383477761 hasRelatedWork W4307481874 @default.
- W4383477761 hasVolume "15" @default.
- W4383477761 isParatext "false" @default.
- W4383477761 isRetracted "false" @default.
- W4383477761 workType "article" @default.