The complexity of broadcasting in planar and decomposable graphs (Q1392535): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126464446, #quickstatements; #temporary_batch_1731336103896
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: K. Ruediger Reischuk / rank
Normal rank
 
Property / author
 
Property / author: K. Ruediger Reischuk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decomposition of graphs into \(k\)-connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of broadcasting in planar and decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Dissemination in Trees / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126464446 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:42, 11 November 2024

scientific article
Language Label Description Also known as
English
The complexity of broadcasting in planar and decomposable graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references