Algorithmic and hardness results for the colorful components problems (Q747623): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Algorithmic and Hardness Results for the Colorful Components Problems
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6276049
@@ Property / title @@
+Algorithmic and Hardness Results for the Colorful Components Problems (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68277
@@ Property / zbMATH Open document ID: 1321.68277 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-54423-1_59
@@ Property / DOI: 10.1007/978-3-642-54423-1_59 / rank @@
+Normal rank
@@ Property / published in @@
+LATIN 2014: Theoretical Informatics
@@ Property / published in: LATIN 2014: Theoretical Informatics / rank @@
+Normal rank
@@ Property / publication date @@
+March 2014Timestamp +2014-03-31T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2014-03-31T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 31 March 2014 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6276049
@@ Property / zbMATH DE Number: 6276049 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58203670
@@ Property / Wikidata QID: Q58203670 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2038922867
@@ Property / OpenAlex ID: W2038922867 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2621812717
@@ Property / OpenAlex ID: W2621812717 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1298
@@ Property / arXiv ID: 1311.1298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-multiway cut problem
@@ Property / cites work: The multi-multiway cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+Partitioning into Colorful Components by Minimum Edge Deletions
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Some Graph Partitioning Problems
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations
+Normal rank

Latest revision as of 21:46, 10 July 2024

scientific article; zbMATH DE number 6276049

Algorithmic and Hardness Results for the Colorful Components Problems

Language	Label	Description	Also known as
English	Algorithmic and hardness results for the colorful components problems	scientific article; zbMATH DE number 6276049	Algorithmic and Hardness Results for the Colorful Components Problems