Matches in SemOpenAlex for { <https://semopenalex.org/work/W1965968804> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W1965968804 endingPage "442" @default.
- W1965968804 startingPage "431" @default.
- W1965968804 abstract "When $mathcal{Z}$ is a finite family of finite sets such that $ cup mathcal{Z} in mathcal{Z}$, there is an associated game $D( mathcal{Z} )$ that a certain player can always win by making enough tests, where a test is a special sort of move in the game. The complexity of $mathcal{Z}$ is defined as the minimum number of tests that suffices to win the game. As a specialization of this notion, there is associated with each connected graph $G = ( {V,E} )$ a game $C( G )$ that involves detecting, in a dynamic setting, the connectedness of a subgraph of G. The number of tests required to win $C( G )$ is called the c-complexity of G. Both the c-complexity and a closely related computational notion are shown to be $O| V |$ when G belongs to a class of graphs that includes all paths and circuits." @default.
- W1965968804 created "2016-06-24" @default.
- W1965968804 creator A5001862829 @default.
- W1965968804 creator A5024906963 @default.
- W1965968804 date "1977-03-01" @default.
- W1965968804 modified "2023-09-28" @default.
- W1965968804 title "The Connectedness Game and thec-Complexity of Certain Graphs" @default.
- W1965968804 cites W12544033 @default.
- W1965968804 cites W1655990431 @default.
- W1965968804 cites W2127470768 @default.
- W1965968804 cites W2144846366 @default.
- W1965968804 doi "https://doi.org/10.1137/0132035" @default.
- W1965968804 hasPublicationYear "1977" @default.
- W1965968804 type Work @default.
- W1965968804 sameAs 1965968804 @default.
- W1965968804 citedByCount "2" @default.
- W1965968804 crossrefType "journal-article" @default.
- W1965968804 hasAuthorship W1965968804A5001862829 @default.
- W1965968804 hasAuthorship W1965968804A5024906963 @default.
- W1965968804 hasConcept C114614502 @default.
- W1965968804 hasConcept C118615104 @default.
- W1965968804 hasConcept C132525143 @default.
- W1965968804 hasConcept C15744967 @default.
- W1965968804 hasConcept C201943243 @default.
- W1965968804 hasConcept C311688 @default.
- W1965968804 hasConcept C33923547 @default.
- W1965968804 hasConcept C39637292 @default.
- W1965968804 hasConcept C542102704 @default.
- W1965968804 hasConcept C88548561 @default.
- W1965968804 hasConcept C94375191 @default.
- W1965968804 hasConceptScore W1965968804C114614502 @default.
- W1965968804 hasConceptScore W1965968804C118615104 @default.
- W1965968804 hasConceptScore W1965968804C132525143 @default.
- W1965968804 hasConceptScore W1965968804C15744967 @default.
- W1965968804 hasConceptScore W1965968804C201943243 @default.
- W1965968804 hasConceptScore W1965968804C311688 @default.
- W1965968804 hasConceptScore W1965968804C33923547 @default.
- W1965968804 hasConceptScore W1965968804C39637292 @default.
- W1965968804 hasConceptScore W1965968804C542102704 @default.
- W1965968804 hasConceptScore W1965968804C88548561 @default.
- W1965968804 hasConceptScore W1965968804C94375191 @default.
- W1965968804 hasIssue "2" @default.
- W1965968804 hasLocation W19659688041 @default.
- W1965968804 hasOpenAccess W1965968804 @default.
- W1965968804 hasPrimaryLocation W19659688041 @default.
- W1965968804 hasRelatedWork W1504200807 @default.
- W1965968804 hasRelatedWork W1978699240 @default.
- W1965968804 hasRelatedWork W2000144448 @default.
- W1965968804 hasRelatedWork W2024593554 @default.
- W1965968804 hasRelatedWork W2067133893 @default.
- W1965968804 hasRelatedWork W2071261821 @default.
- W1965968804 hasRelatedWork W2161147766 @default.
- W1965968804 hasRelatedWork W2161679356 @default.
- W1965968804 hasRelatedWork W2287003313 @default.
- W1965968804 hasRelatedWork W3003396734 @default.
- W1965968804 hasVolume "32" @default.
- W1965968804 isParatext "false" @default.
- W1965968804 isRetracted "false" @default.
- W1965968804 magId "1965968804" @default.
- W1965968804 workType "article" @default.