Mixed Covering of Trees and the Augmentation Problem With Odd Diameter Constraints

Algorithmica - United States
doi 10.1007/s00453-005-1183-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Nature

Related search

The Number of Subtrees of Trees With Given Diameter

Discrete Mathematics, Algorithms and Applications
CombinatoricsDiscrete Mathematics
2018English

On the Covering Steiner Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Exploring Link Covering and Node Covering Formulations of Detection Layout Problem

Transportation Research Record
CivilMechanical EngineeringStructural Engineering
2012English

Fuzzy Relational Equations and the Covering Problem

2015English

Logics for Unordered Trees With Data Constraints

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2019English

Performance Augmentation of Video Retrieval Using Even-Odd Videos With Multilevel Block Truncation Coding

International Journal of Computer Applications
2013English

On a Combinatorial Problem Associated With the Odd Order Theorem

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1993English

A Family of Mixed Graphs With Large Order and Diameter 2

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

An Approach for Solving Maximal Covering Location Problems With Fuzzy Constraints

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy