Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs (Q5505675): 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.1007/978-3-540-85097-7_35 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1576493106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs with the path‐merging property / rank
 
Normal rank
Property / cites work
 
Property / cites work: In-tournament digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of tournaments: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Homomorphisms to Reflexive Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Homomorphism Dichotomy for Oriented Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost and list homomorphisms to semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost homomorphisms to semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level of repair analysis and minimum cost homomorphisms of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy for minimum cost graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:54, 28 June 2024

scientific article; zbMATH DE number 5498472
Language Label Description Also known as
English
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
scientific article; zbMATH DE number 5498472

    Statements

    Identifiers