Algorithms for maximum independent set in convex bipartite graphs (Q1017904): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-007-9006-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2101075550
@@ Property / OpenAlex ID: W2101075550 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Q2766672
@@ Property / cites work: Q2766672 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel maximum independent set in convex bipartite graphs
+Normal rank
@@ Property / cites work @@
+SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
+Normal rank
@@ Property / cites work @@
+Maximum matching in a convex bipartite graph
@@ Property / cites work: Maximum matching in a convex bipartite graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228477
@@ Property / cites work: Q4228477 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for maximum matchings in convex, bipartite graphs
+Normal rank