Many-To-Many Graph Matching: A Continuous Relaxation Approach

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-15939-8_33
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Many-To-One Matching: Externalities and Stability

2020English

One-To-Many Node Matching Between Complex Networks

Advances in Complex Systems
ControlSystems EngineeringMultidisciplinary
2010English

Many-Body Contributions to Spin Relaxation in Semiconductors

English

Many-To-One Stable Matching: Geometry and Fairness

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2006English

How Many Pairwise Preferences Do We Need to Rank a Graph Consistently?

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Using a Many-Objective Approach to Investigate Automated Refactoring

Information and Software Technology
Computer Science ApplicationsInformation SystemsSoftware
2019English

Many Worlds, Many Theories?

Revista Brasileira de Politica Internacional
International RelationsPolitical ScienceHistory
2016English

Editorial Perspectives: Many, Many Ways to Talk About Socialism

Science and Society
SociologyPolitical Science
2016English

How to Approach the Many Faces of Endometrioid Carcinoma

Modern Pathology
Forensic MedicinePathology
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy