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

@@ Property / author @@
-Tadashi Sakuma
@@ Property / author: Tadashi Sakuma / rank @@
-Normal rank
@@ Property / author @@
+Tadashi Sakuma
@@ Property / author: Tadashi Sakuma / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963756682
@@ Property / OpenAlex ID: W2963756682 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03579
@@ Property / arXiv ID: 1802.03579 / rank @@
+Normal rank
@@ Property / cites work @@
+Safe sets in graphs: graph classes and structural parameters
+Normal rank
@@ Property / cites work @@
+Network majority on tree topological network
@@ Property / cites work: Network majority on tree topological network / rank @@
+Normal rank
@@ Property / cites work @@
+Q3065457
@@ Property / cites work: Q3065457 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating connected safe sets in weighted trees
+Normal rank
@@ Property / cites work @@
+Safe set problem on graphs
@@ Property / cites work: Safe set problem on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The enumeration of vertex induced subgraphs with respect to the number of components
+Normal rank
@@ Property / Wikidata QID @@
+Q129715135
@@ Property / Wikidata QID: Q129715135 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2420660