Algorithms for a maximum clique and a maximum independent set of a circle graph (Q5675749): Difference between revisions

@@ Property / Wikidata QID @@
+Q56210413
@@ Property / Wikidata QID: Q56210413 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.3230030305
+Normal rank
@@ Property / OpenAlex ID @@
+W2052850644
@@ Property / OpenAlex ID: W2052850644 / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/networks/Gavril73
@@ Property / DBLP publication ID: journals/networks/Gavril73 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5675749