Hierarchical alignment of weighted directed acyclic graphs

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Unknown venue

• Publication date

  2006-06-29

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Graph Matching Algorithm and Its Application to Conceptual System Translation

  2005cited by this paper
• Visualizing differences of UML diagrams with Fujaba [ Position Paper ]

  2004cited by this paper
• The PROMPT suite: interactive tools for ontology merging and mapping

  2003cited by this paper
• Clique is hard to approximate withinn1−ε

  1999cited by this paper
• An Algorithm for Merging and Aligning Ontologies: Automation and Tool Support

  1999cited by this paper
• Independent Sets with Domination Constraints

  1998cited by this paper
• Solving Various Weighted Matching Problems with Constraints

  1997cited by this paper
• Clique is hard to approximate within n 1 − ǫ

  1996cited by this paper
• A Graduated Assignment Algorithm for Graph Matching

  1996cited by this paper
• A Bipartite Matching Approach to Approximate String Comparison and Search

  1995cited by this paper
• A Lagrangian relaxation network for graph matching

  1994cited by this paper
• Application of genetic algorithms in graph matching

  1994cited by this paper
• A Linear Programming Approach for the Weighted Graph Matching Problem

  1993cited by this paper
• A translation approach to portable ontology specifications

  1993cited by this paper
• Approximating maximum independent sets by excluding subgraphs

  1990cited by this paper
• An Eigendecomposition Approach to Weighted Graph Matching Problems

  1988cited by this paper
• Pattern Recognition by Graph Matching - Combinatorial versus continuous Optimization

  1988cited by this paper
• An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs

  1986cited by this paper
• A graph distance measure for image analysis

  1984cited by this paper
• Subgraph error-correcting isomorphisms for syntactic pattern recognition

  1983cited by this paper
• On the Foundations of Relaxation Labeling Processes

  1983cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Structural Descriptions and Inexact Matching

  1981cited by this paper
• Journal of Graph Algorithms and Applications Approximations of Weighted Independent Set and Hereditary Subset Problems

  year unknowncited by this paper

• Measuring the Structural Preservation of Semantic Hierarchy Alignment

  2009cites this paper