Matches in SemOpenAlex for { <https://semopenalex.org/work/W1977644778> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W1977644778 endingPage "25" @default.
- W1977644778 startingPage "2" @default.
- W1977644778 abstract "Entanglement is a parameter for the complexity of finite directed graphs that measures to what extent the cycles of the graph are intertwined. It is defined by way of a game similar in spirit to the cops and robber games used to describe treewidth, directed treewidth, and hypertree width. Nevertheless, on many classes of graphs, there are significant differences between entanglement and the various incarnations of treewidth. Entanglement is intimately related with the computational and descriptive complexity of the modal μ-calculus. The number of fixed-point variables needed to describe a finite graph up to bisimulation is captured by its entanglement. This plays a crucial role in the proof that the variable hierarchy of the μ-calculus is strict. We study complexity issues for entanglement and compare it to other structural parameters of directed graphs. One of our main results is that parity games of bounded entanglement can be solved in polynomial time. Specifically, we establish that the complexity of solving a parity game can be parametrised in terms of the minimal entanglement of subgames induced by a winning strategy. Furthermore, we discuss the case of graphs of entanglement two. While graphs of entanglement zero and one are very simple, graphs of entanglement two allow arbitrary nesting of cycles, and they form a sufficiently rich class for modelling relevant classes of structured systems. We provide characterisations of this class, and propose decomposition notions similar to the ones for treewidth, DAG-width, and Kelly-width." @default.
- W1977644778 created "2016-06-24" @default.
- W1977644778 creator A5010064604 @default.
- W1977644778 creator A5012313268 @default.
- W1977644778 creator A5055804698 @default.
- W1977644778 creator A5073512540 @default.
- W1977644778 date "2012-12-01" @default.
- W1977644778 modified "2023-10-18" @default.
- W1977644778 title "Entanglement and the complexity of directed graphs" @default.
- W1977644778 cites W1986058515 @default.
- W1977644778 cites W1989887898 @default.
- W1977644778 cites W2002722727 @default.
- W1977644778 cites W2011911122 @default.
- W1977644778 cites W2015640848 @default.
- W1977644778 cites W2033405938 @default.
- W1977644778 cites W2054167510 @default.
- W1977644778 cites W2060375000 @default.
- W1977644778 cites W2067543765 @default.
- W1977644778 cites W2083896385 @default.
- W1977644778 cites W2087083200 @default.
- W1977644778 cites W2090787331 @default.
- W1977644778 cites W2127618440 @default.
- W1977644778 cites W4241108585 @default.
- W1977644778 doi "https://doi.org/10.1016/j.tcs.2012.07.010" @default.
- W1977644778 hasPublicationYear "2012" @default.
- W1977644778 type Work @default.
- W1977644778 sameAs 1977644778 @default.
- W1977644778 citedByCount "39" @default.
- W1977644778 countsByYear W19776447782013 @default.
- W1977644778 countsByYear W19776447782014 @default.
- W1977644778 countsByYear W19776447782015 @default.
- W1977644778 countsByYear W19776447782016 @default.
- W1977644778 countsByYear W19776447782017 @default.
- W1977644778 countsByYear W19776447782018 @default.
- W1977644778 countsByYear W19776447782019 @default.
- W1977644778 countsByYear W19776447782020 @default.
- W1977644778 countsByYear W19776447782022 @default.
- W1977644778 countsByYear W19776447782023 @default.
- W1977644778 crossrefType "journal-article" @default.
- W1977644778 hasAuthorship W1977644778A5010064604 @default.
- W1977644778 hasAuthorship W1977644778A5012313268 @default.
- W1977644778 hasAuthorship W1977644778A5055804698 @default.
- W1977644778 hasAuthorship W1977644778A5073512540 @default.
- W1977644778 hasBestOaLocation W19776447781 @default.
- W1977644778 hasConcept C114614502 @default.
- W1977644778 hasConcept C118615104 @default.
- W1977644778 hasConcept C121040770 @default.
- W1977644778 hasConcept C121332964 @default.
- W1977644778 hasConcept C132525143 @default.
- W1977644778 hasConcept C132569581 @default.
- W1977644778 hasConcept C203776342 @default.
- W1977644778 hasConcept C33923547 @default.
- W1977644778 hasConcept C43517604 @default.
- W1977644778 hasConcept C62520636 @default.
- W1977644778 hasConcept C84114770 @default.
- W1977644778 hasConceptScore W1977644778C114614502 @default.
- W1977644778 hasConceptScore W1977644778C118615104 @default.
- W1977644778 hasConceptScore W1977644778C121040770 @default.
- W1977644778 hasConceptScore W1977644778C121332964 @default.
- W1977644778 hasConceptScore W1977644778C132525143 @default.
- W1977644778 hasConceptScore W1977644778C132569581 @default.
- W1977644778 hasConceptScore W1977644778C203776342 @default.
- W1977644778 hasConceptScore W1977644778C33923547 @default.
- W1977644778 hasConceptScore W1977644778C43517604 @default.
- W1977644778 hasConceptScore W1977644778C62520636 @default.
- W1977644778 hasConceptScore W1977644778C84114770 @default.
- W1977644778 hasLocation W19776447781 @default.
- W1977644778 hasLocation W19776447782 @default.
- W1977644778 hasOpenAccess W1977644778 @default.
- W1977644778 hasPrimaryLocation W19776447781 @default.
- W1977644778 hasRelatedWork W1980466385 @default.
- W1977644778 hasRelatedWork W2135382359 @default.
- W1977644778 hasRelatedWork W2497554862 @default.
- W1977644778 hasRelatedWork W2607123191 @default.
- W1977644778 hasRelatedWork W2626211790 @default.
- W1977644778 hasRelatedWork W2766499403 @default.
- W1977644778 hasRelatedWork W3134208201 @default.
- W1977644778 hasRelatedWork W3213684639 @default.
- W1977644778 hasRelatedWork W4281819861 @default.
- W1977644778 hasRelatedWork W4286287454 @default.
- W1977644778 hasVolume "463" @default.
- W1977644778 isParatext "false" @default.
- W1977644778 isRetracted "false" @default.
- W1977644778 magId "1977644778" @default.
- W1977644778 workType "article" @default.