On the weighted safe set problem on paths and cycles (Q2420660): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129715135, #quickstatements; #temporary_batch_1726327587925
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963756682 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.03579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe sets in graphs: graph classes and structural parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network majority on tree topological network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3065457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating connected safe sets in weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe set problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The enumeration of vertex induced subgraphs with respect to the number of components / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129715135 / rank
 
Normal rank

Latest revision as of 16:38, 14 September 2024

scientific article
Language Label Description Also known as
English
On the weighted safe set problem on paths and cycles
scientific article

    Statements

    On the weighted safe set problem on paths and cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 June 2019
    0 references
    safe set
    0 references
    connected safe set
    0 references
    weighted graph
    0 references
    safe-finite
    0 references
    subgraph component polynomial
    0 references

    Identifiers