Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_31 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted version of the jump number problem on two-dimensional orders is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Regions by Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3984738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum generators of path systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal edge-coverings of pairs of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to increase the node-connectivity of a digraph by one / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for covering polygons with rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax theorem on intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundant intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted min-max relation for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycle-free matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge perfectness and classes of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical analysis of human leukocyte antigen serology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orthogonal ray graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders / rank
 
Normal rank

Latest revision as of 05:44, 4 July 2024

scientific article
Language Label Description Also known as
English
Jump Number of Two-Directional Orthogonal Ray Graphs
scientific article

    Statements

    Jump Number of Two-Directional Orthogonal Ray Graphs (English)
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references