Weighted total acquisition
From MaRDI portal
Publication:2231771
Signed and weighted graphs (05C22) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- Acquisition-extremal graphs
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Distributed time-optimal scheduling for convergecast in wireless sensor networks
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks
- Fractional acquisition in graphs
- Graph Classes: A Survey
- Graph theory
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 1185306 (Why is no real title available?)
- scientific article; zbMATH DE number 2170474 (Why is no real title available?)
- Reducibility among combinatorial problems
- Some results on acquisition numbers
- The total acquisition number of random geometric graphs
- The total acquisition number of random graphs
- The total acquisition number of the randomly weighted path
- The unit acquisition number of a graph
- Total acquisition in graphs
- Total acquisition on grids
This page was built for publication: Weighted total acquisition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231771)