Basic Terminology, Notation and Results (Q3120433): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Spanning Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In-tournament digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spanning strong subdigraph problem is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for problems with no kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbins's Theorem for Mixed Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Graph Homomorphism and Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-contractions, edge deletions and connectivity preservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rural postman parameterized by the number of components of required edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linkedness and Ordered Cycles in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les arborescences dans un graphe oriente / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full derandomization of schöning's k-SAT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint branching in directed multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new view on rural postman based on Eulerian extension and matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank

Latest revision as of 10:23, 18 July 2024

scientific article
Language Label Description Also known as
English
Basic Terminology, Notation and Results
scientific article

    Statements

    Basic Terminology, Notation and Results (English)
    0 references
    0 references
    0 references
    4 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers