Spanning trees with few branch vertices in graphs of bounded neighborhood diversity (Q6148080): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parameterized complexity of happy coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4560236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering with Minimum Delay in Tree Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time data gathering in wireless networks with multidirectional antennas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structural parameterizations of star coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the spanning tree with minimum branch vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations, models and a memetic approach for three degree-dependent spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree spanning tree problems: models and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating spanning trees with few branches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evangelism in social networks: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Type Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of immunization in the threshold model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability of Clique-Width Parameterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning spiders and light-splitting switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conflict-free colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision-free path coloring with application to minimum-delay gathering in sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming in parameterized complexity: five miniatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods based on articulation vertices for degree-dependent spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with a bounded number of branch vertices in a claw-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-plane-based algorithms for two branch vertices related spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the minimum branch vertices spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity / rank
 
Normal rank

Latest revision as of 17:05, 22 August 2024

scientific article; zbMATH DE number 7786533
Language Label Description Also known as
English
Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
scientific article; zbMATH DE number 7786533

    Statements

    Spanning trees with few branch vertices in graphs of bounded neighborhood diversity (English)
    0 references
    0 references
    0 references
    11 January 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree
    0 references
    fixed Parameterized algorithms
    0 references
    neighborhood diversity
    0 references
    0 references
    0 references
    0 references
    0 references