Efficient Matching of Dynamically Changing Graphs

Theory and Applications of Image Analysis
doi 10.1142/9789812797896_0012
Full Text
Abstract

Available in full text

Date
Authors
Publisher

WORLD SCIENTIFIC

Related search

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Data Science and Engineering
Computational MechanicsComputer Science Applications
2019English

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

Matching Dominating Sets of Interval Graphs

International Journal of Computer Applications
2014English

Efficient Semantic Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Multivariate Matching Polynomials of Cyclically Labelled Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Perfect Matching and Circuit Cover of Graphs

English

Matching and Stable Cutsets in Graphs.

English

Matching Hierarchical Structures Using Association Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Monitoring Dynamically Changing Environments by Ubiquitous Vision System

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy