Improving bipartite graph edit distance approximation using various search strategies (Q1678686): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CLUSTISZ / 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.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027340372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance measure between attributed relational graphs for pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact graph matching for structural pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of graph edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Representations in Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural, Syntactic, and Statistical Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving bipartite graph edit distance approximation using various search strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the simplex algorithm for networks and generalized networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Scaling Network Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost operator algorithms for the transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural pattern recognition using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Separated Clusters and Optimal Fuzzy Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of association for cross classifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dissimilarity Representation for Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridging the Gap between Graph Edit Distance and Kernel Machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:52, 14 July 2024

scientific article
Language Label Description Also known as
English
Improving bipartite graph edit distance approximation using various search strategies
scientific article

    Statements

    Improving bipartite graph edit distance approximation using various search strategies (English)
    0 references
    0 references
    0 references
    20 November 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite graph matching
    0 references
    approximate graph edit distance
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references