It is tough to be a plumber (Q1885007): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2002.12.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2135480548
@@ Property / OpenAlex ID: W2135480548 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57601589
@@ Property / Wikidata QID: Q57601589 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768314
@@ Property / cites work: Q2768314 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A special planar satisfiability problem and a consequence of its NP- completeness
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the thickness of graphs is NP-hard
@@ Property / cites work: Determining the thickness of graphs is NP-hard / rank @@
+Normal rank