- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Connected Subgraph Defense Games ; volume:83 ; number:11 ; day:1 ; month:8 ; year:2021 ; pages:3403-3431 ; date:11.2021
Algorithmica ; 83, Heft 11 (1.8.2021), 3403-3431, 11.2021
- Creator
-
Akrida, Eleni C.
Deligkas, Argyrios
Melissourgos, Themistoklis
Spirakis, Paul G.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00858-z
- URN
-
urn:nbn:de:101:1-2022010719261987967437
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:34 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Akrida, Eleni C.
- Deligkas, Argyrios
- Melissourgos, Themistoklis
- Spirakis, Paul G.
- SpringerLink (Online service)
Other Objects (12)
Subgraph Complementation
Subgraph Mining
An Experimental Evaluation of Summarisation-Based Frequent Subgraph Mining for Subgraph Searching
The maximum planar subgraph problem
SURREAL: Subgraph Robust Representation Learning
Towards Discovery of Subgraph Bisociations
Subjective interestingness of subgraph patterns
Verteiltes Subgraph-Counting mit Colorcoding
Planarization With Fixed Subgraph Embedding
Strong Subgraph Connectivity of Digraphs
Jaccard-constrained dense subgraph discovery
Inductive Subgraph Embedding for Link Prediction
Subgraph Complementation
Subgraph Mining
An Experimental Evaluation of Summarisation-Based Frequent Subgraph Mining for Subgraph Searching
The maximum planar subgraph problem
SURREAL: Subgraph Robust Representation Learning
Towards Discovery of Subgraph Bisociations
Subjective interestingness of subgraph patterns
Verteiltes Subgraph-Counting mit Colorcoding
Planarization With Fixed Subgraph Embedding
Strong Subgraph Connectivity of Digraphs
Jaccard-constrained dense subgraph discovery
Inductive Subgraph Embedding for Link Prediction
Subgraph Complementation
Subgraph Mining
An Experimental Evaluation of Summarisation-Based Frequent Subgraph Mining for Subgraph Searching
The maximum planar subgraph problem
SURREAL: Subgraph Robust Representation Learning
Towards Discovery of Subgraph Bisociations
Subjective interestingness of subgraph patterns
Verteiltes Subgraph-Counting mit Colorcoding
Planarization With Fixed Subgraph Embedding
Strong Subgraph Connectivity of Digraphs
Jaccard-constrained dense subgraph discovery