On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/11602613_44
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

Vertex Decompositions of Sparse Graphs Into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most K

Journal of Graph Theory
GeometryTopology
2009English

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Efficient Dynamic and On-Line Computation With Applications.

English

Weighted Distance Maps Computation on Parametric Three-Dimensional Manifolds

Journal of Computational Physics
Numerical AnalysisApplied MathematicsSimulationComputer Science ApplicationsModelingComputational MathematicsAstronomyPhysics
2007English

Warranty Claim Forecasting Based on Weighted Maximum Likelihood Estimation

Quality and Reliability Engineering International
RiskManagement ScienceReliabilitySafetyQualityOperations Research
2012English

Some Results on Weighted Critical Quasilinear Problems

Differential Equations & Applications
2010English

Rhumb-Line Sailing by Computation

Reports on Geodesy and Geoinformatics
2013English

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy