Pages that link to "Item:Q957360"

The following pages link to Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360):

Displayed 13 items.

• Complexity of splits reconstruction for low-degree trees (Q476307) ‎ (← links)
• Burning number of caterpillars (Q777401) ‎ (← links)
• NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) ‎ (← links)
• A note on the hardness of Skolem-type sequences (Q972331) ‎ (← links)
• On the burning number of \(p\)-caterpillars (Q2056898) ‎ (← links)
• Relaxed and approximate graph realizations (Q2115836) ‎ (← links)
• A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732) ‎ (← links)
• The piggyback transportation problem: transporting drones launched from a flying warehouse (Q2242297) ‎ (← links)
• The complexity of degree anonymization by graph contractions (Q2407102) ‎ (← links)
• Burning a graph is hard (Q2410223) ‎ (← links)
• One-dimensional vehicle scheduling with a front-end depot and non-crossing constraints (Q2454369) ‎ (← links)
• Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774) ‎ (← links)
• NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) ‎ (← links)