Matches in SemOpenAlex for { <https://semopenalex.org/work/W2351046924> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W2351046924 abstract "A cyclic edge cut set is an edge cut set whose deletion disconnects the graph such that two of the components contain a cycle respectively.The cyclic edge connectivity cλ(G) is the minimum cardinality of all the cyclic edge cut sets of G.There is no polynomial time algorithm to determine the cyclic edge connectivity of a graph. In this paper,we develop a polynomial time algorithm to determine the cyclic edge connectivity of a planar graph.The time complexity of the algorithm is bounded by O(|V|~2 )." @default.
- W2351046924 created "2016-06-24" @default.
- W2351046924 creator A5061255464 @default.
- W2351046924 date "2009-01-01" @default.
- W2351046924 modified "2023-09-27" @default.
- W2351046924 title "Efficient algorithm for cyclic edge connectivity of planar graphs" @default.
- W2351046924 hasPublicationYear "2009" @default.
- W2351046924 type Work @default.
- W2351046924 sameAs 2351046924 @default.
- W2351046924 citedByCount "0" @default.
- W2351046924 crossrefType "journal-article" @default.
- W2351046924 hasAuthorship W2351046924A5061255464 @default.
- W2351046924 hasConcept C101837359 @default.
- W2351046924 hasConcept C11413529 @default.
- W2351046924 hasConcept C114614502 @default.
- W2351046924 hasConcept C118615104 @default.
- W2351046924 hasConcept C132525143 @default.
- W2351046924 hasConcept C149530733 @default.
- W2351046924 hasConcept C154945302 @default.
- W2351046924 hasConcept C162307627 @default.
- W2351046924 hasConcept C203776342 @default.
- W2351046924 hasConcept C204562854 @default.
- W2351046924 hasConcept C311688 @default.
- W2351046924 hasConcept C33923547 @default.
- W2351046924 hasConcept C41008148 @default.
- W2351046924 hasConceptScore W2351046924C101837359 @default.
- W2351046924 hasConceptScore W2351046924C11413529 @default.
- W2351046924 hasConceptScore W2351046924C114614502 @default.
- W2351046924 hasConceptScore W2351046924C118615104 @default.
- W2351046924 hasConceptScore W2351046924C132525143 @default.
- W2351046924 hasConceptScore W2351046924C149530733 @default.
- W2351046924 hasConceptScore W2351046924C154945302 @default.
- W2351046924 hasConceptScore W2351046924C162307627 @default.
- W2351046924 hasConceptScore W2351046924C203776342 @default.
- W2351046924 hasConceptScore W2351046924C204562854 @default.
- W2351046924 hasConceptScore W2351046924C311688 @default.
- W2351046924 hasConceptScore W2351046924C33923547 @default.
- W2351046924 hasConceptScore W2351046924C41008148 @default.
- W2351046924 hasLocation W23510469241 @default.
- W2351046924 hasOpenAccess W2351046924 @default.
- W2351046924 hasPrimaryLocation W23510469241 @default.
- W2351046924 hasRelatedWork W1414495935 @default.
- W2351046924 hasRelatedWork W1483726570 @default.
- W2351046924 hasRelatedWork W1581300568 @default.
- W2351046924 hasRelatedWork W1709205181 @default.
- W2351046924 hasRelatedWork W1963724232 @default.
- W2351046924 hasRelatedWork W1991632262 @default.
- W2351046924 hasRelatedWork W2035272561 @default.
- W2351046924 hasRelatedWork W2045281628 @default.
- W2351046924 hasRelatedWork W2057915045 @default.
- W2351046924 hasRelatedWork W2102694510 @default.
- W2351046924 hasRelatedWork W2110635609 @default.
- W2351046924 hasRelatedWork W2129352792 @default.
- W2351046924 hasRelatedWork W2133225996 @default.
- W2351046924 hasRelatedWork W2762935521 @default.
- W2351046924 hasRelatedWork W2794618278 @default.
- W2351046924 hasRelatedWork W2905360057 @default.
- W2351046924 hasRelatedWork W2963881335 @default.
- W2351046924 hasRelatedWork W2997134453 @default.
- W2351046924 hasRelatedWork W3098447893 @default.
- W2351046924 hasRelatedWork W2949380505 @default.
- W2351046924 isParatext "false" @default.
- W2351046924 isRetracted "false" @default.
- W2351046924 magId "2351046924" @default.
- W2351046924 workType "article" @default.