Count Matroids of Group-Labeled Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Combinatorica"
DOI: 10.1007/s00493-016-3469-8
Abstract: A graph G = (V, E) is called (k, ℓ)-sparse if |F| ≤ k|V (F)| − ℓ for any nonempty F ⊆ E, where V (F) denotes the set of vertices incident to F. It… read more here.
Keywords: matroids group; group; labeled graphs; count matroids ... See more keywords
Subpath Queries on Compressed Graphs: a Survey
Sign Up to like & getrecommendations! Published in 2021 at "Algorithms"
DOI: 10.3390/a14010014
Abstract: Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text $T$, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any… read more here.
Keywords: compressed graphs; graphs survey; queries compressed; survey ... See more keywords
A General Computational Approach for Counting Labeled Graphs
Sign Up to like & getrecommendations! Published in 2022 at "Algorithms"
DOI: 10.3390/a16010016
Abstract: This paper presents a general recursive formula to estimate the number of labeled graphs as well as details to evaluate the formula for the following graph properties: number of edges (graph density), degree sequence, degree… read more here.
Keywords: computational approach; number; labeled graphs; general computational ... See more keywords
Designing Labeled Graph Classifiers by Exploiting the Rényi Entropy of the Dissimilarity Representation
Sign Up to like & getrecommendations! Published in 2017 at "Entropy"
DOI: 10.3390/e19050216
Abstract: Representing patterns as labeled graphs is becoming increasingly common in the broad field of computational intelligence. Accordingly, a wide repertoire of pattern recognition tools, such as classifiers and knowledge discovery procedures, are nowadays available and… read more here.
Keywords: labeled graphs; labeled graph; dissimilarity representation; designing labeled ... See more keywords