Efficient polynomial algorithms for distributive lattices (Q810071): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexité de problèmes liés aux graphes sans circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite graphs and crowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs Orientable as Distributive Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: N-free posets as generalizations of series-parallel posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some complexity properties of N-free posets and posets with bounded decomposition diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diamètre de graphes et qualité de service d'un réseau de données / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Implementations of Graph Search Methods / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:58, 24 June 2024

scientific article
Language Label Description Also known as
English
Efficient polynomial algorithms for distributive lattices
scientific article

    Statements

    Efficient polynomial algorithms for distributive lattices (English)
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    breadth-first search
    0 references
    Hasse graph of a distributive lattice
    0 references
    polynomial problems
    0 references
    canonical decomposition
    0 references
    transitive closure
    0 references
    generation
    0 references
    recognition
    0 references
    orientability
    0 references
    combinatorial algorithm
    0 references