scientific article

zbMATH Open0657.90049MaRDI QIDQ3806971

Krzysztof Ficoń

Publication date: 1986

Title of this publication is not available (Why is that?)

zbMATH Keywords

bipartite graphmatchingsbinary method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On two-processor scheduling and maximum matching in permutation graphs 👍 👎
• Scheduling a batch processing machine with bipartite compatibility graphs 👍 👎
• Scheduling with conflicts on bipartite and interval graphs 👍 👎
• Scheduling on a batch processing machine with split compatibility graphs 👍 👎
• Solving Matching Problems Efficiently in Bipartite Graphs 👍 👎
• Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments 👍 👎

This page was built for publication:

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