Finding Good Decompositions for Dynamic Programming on Dense Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-28050-4_18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Fractional Clique Decompositions of Dense Partite Graphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2017English

Dynamic Programming on Nominal Graphs

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2015English

Dense Dynamic Programming on Multi GPU

2011English

Decompositions of Complete Multipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Tree Decompositions and Social Graphs

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2016English

Finding Good Reads on Goodreads

Reference and User Services Quarterly
Information SystemsLibraryInformation Sciences
2012English

Edge–preserving Denoising Based on Dynamic Programming on the Full Set of Adjacency Graphs

ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
2017English

New Strategies for Finding Multiplicative Decompositions of Probability Trees

Applied Mathematics and Computation
Computational MathematicsApplied Mathematics
2013English

Finding Small Stabilizers for Unstable Graphs

Mathematical Programming, Series B
MathematicsSoftware
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy