Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Path-matching problems

From MaRDI portal
Publication:1193516
Jump to:navigation, search

DOI10.1007/BF01758837zbMath0753.68082MaRDI QIDQ1193516

Sun Wu, Udi Manber

Publication date: 27 September 1992

Published in: Algorithmica (Search for Journal in Brave)


zbMATH Keywords

matching in graphs


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)


Related Items

1-Approximation algorithm for bottleneck disjoint path matching ⋮ Length-constrained path-matchings in graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Algorithms for two bottleneck optimization problems
  • On the Computational Complexity of Combinatorial Problems
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1193516&oldid=13251759"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki