Efficient subgraph matching using topological node feature constraints (Q1677053): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: gSpan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: igraph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2014.05.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009810092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric filtering algorithm for the graph isomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large database of graphs and its use for benchmarking graph isomorphism algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction algorithms for graph pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving subgraph isomorphism problems with constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: AllDifferent-based filtering for subgraph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396694 / rank
 
Normal rank

Latest revision as of 16:39, 14 July 2024

scientific article
Language Label Description Also known as
English
Efficient subgraph matching using topological node feature constraints
scientific article

    Statements

    Efficient subgraph matching using topological node feature constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2017
    0 references
    graph matching
    0 references
    subgraph isomorphism
    0 references
    topological node features
    0 references
    0 references
    0 references

    Identifiers