Dual graph contraction with LEDA

MaRDI QIDQ4218496zbMATH OpenFDO

Authors Mark James Burge, S. Ben Yacoub, Nazha Selmaoui, Walter G. Kropatsch

Publication date 30 March 1999

zbMATH Keywords

machine visionpyramidsstructural image analysis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• Multi-valued graph contraction principle with applications
• Distance-Preserving Graph Contractions
• Distance-Preserving Graph Contractions
• Reducing graph transversals via edge contractions
• Reducing graph transversals via edge contractions
• On contraction method to cleansing duplicates in graph
• Contraction obstructions for connected graph searching
• Dualizability of graphs
• Contraction ratios for graph-directed iterated constructions
• Edge-matching graph contractions and their interlacing properties

Cited in

(2)

• Design and implementation of efficient data types for static graphs
• scientific article; zbMATH DE number 2079739 (Why is no real title available?)

This page was built for publication: Dual graph contraction with LEDA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218496)