- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Improved Distance Queries and Cycle Counting by Frobenius Normal Form ; day:21 ; month:11 ; year:2018 ; pages:1-19
Theory of computing systems ; (21.11.2018), 1-19
- Creator
-
Sankowski, Piotr
Węgrzycki, Karol
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-018-9894-x
- URN
-
urn:nbn:de:101:1-2019010419172700169838
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:02 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
- Sankowski, Piotr
- Węgrzycki, Karol
- SpringerLink (Online service)
Other Objects (12)
Conjunctive queries, arithmetic circuits and counting complexity
Learning with Small Data: Subgraph Counting Queries
Conjunctive queries, arithmetic circuits and counting complexity
Exploiting d-DNNFs for Repetitive Counting Queries on Feature Models
Improved Counting Statistics of an Ultrafine DMPS System
Two new perspectives on algorithmic meta-theorems : evaluating approximate first-order counting queries on bounded expansion and first-order queries on random graphs
BatchHL $$^+}$$ + : batch dynamic labelling for distance queries on large-scale networks
![[Q]ueries](https://iiif.deutsche-digitale-bibliothek.de/image/2/b7071f7d-2ed4-4ce3-bb4c-859ee7da0cc7/full/!306,450/0/default.jpg)
[Q]ueries
History queries
![[Q]ueries](https://iiif.deutsche-digitale-bibliothek.de/image/2/70c4f662-8c02-4952-b3af-a3d69b1bdd23/full/!306,450/0/default.jpg)
[Q]ueries
Saraswati queries
Missionary queries
Conjunctive queries, arithmetic circuits and counting complexity
Learning with Small Data: Subgraph Counting Queries
Conjunctive queries, arithmetic circuits and counting complexity
Exploiting d-DNNFs for Repetitive Counting Queries on Feature Models
Improved Counting Statistics of an Ultrafine DMPS System
Two new perspectives on algorithmic meta-theorems : evaluating approximate first-order counting queries on bounded expansion and first-order queries on random graphs
BatchHL $$^+}$$ + : batch dynamic labelling for distance queries on large-scale networks
[Q]ueries
History queries
[Q]ueries
Saraswati queries
Missionary queries
Conjunctive queries, arithmetic circuits and counting complexity
Learning with Small Data: Subgraph Counting Queries
Conjunctive queries, arithmetic circuits and counting complexity
Exploiting d-DNNFs for Repetitive Counting Queries on Feature Models
Improved Counting Statistics of an Ultrafine DMPS System
Two new perspectives on algorithmic meta-theorems : evaluating approximate first-order counting queries on bounded expansion and first-order queries on random graphs
BatchHL $$^+}$$ + : batch dynamic labelling for distance queries on large-scale networks
[Q]ueries
History queries
[Q]ueries
Saraswati queries