Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2010.11.003 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138118431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Nash equilibria for scheduling on restricted parallel links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting small induced subgraphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Second Order Logic on Graphs with Local Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum indegree / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2010.11.003 / rank
 
Normal rank

Latest revision as of 02:02, 10 December 2024

scientific article
Language Label Description Also known as
English
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
scientific article

    Statements

    Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2011
    0 references
    graph orientation
    0 references
    min-max optimization
    0 references
    \(\mathcal {NP}\)-hardness
    0 references
    cactus
    0 references
    (outer)planar
    0 references
    \((P_{4}-)\)bipartite
    0 references
    series-parallel
    0 references

    Identifiers