Edge ranking and searching in partial orders (Q955315): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.03.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064883689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking of weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for finding low-degree subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching ordered structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum average cost testing for partially ordered components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Edge Ranking Spanning Trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:41, 28 June 2024

scientific article
Language Label Description Also known as
English
Edge ranking and searching in partial orders
scientific article

    Statements

    Edge ranking and searching in partial orders (English)
    0 references
    19 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dag
    0 references
    edge ranking
    0 references
    graph searching
    0 references
    poset
    0 references
    spanning tree
    0 references
    0 references