THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130): Difference between revisions

Latest revision as of 14:30, 7 June 2024

scientific article; zbMATH DE number 2106719

Language	Label	Description	Also known as
English	THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS	scientific article; zbMATH DE number 2106719

Statements

instance of

scholarly article

0 references

title

THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (English)

0 references

zbMATH Open document ID

1049.68925

0 references

DOI

10.1080/10637199508915531

0 references

0 references

0 references

Parallel Algorithms and Applications

0 references

publication date

6 October 2004

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10637199508915531

0 references

0 references

0 references

Perfect codes in graphs

0 references

Graph-theoretic parameters concerning domination, independence, and irredundance

0 references

Towards a theory of domination in graphs

0 references

Q4198056

0 references

Efficient edge domination problems in graphs

0 references

Q3328583

0 references

Steiner trees, connected domination and strongly chordal graphs

0 references

A new upper bound on the complexity of the all pairs shortest path problem

0 references

Q3291034

0 references

A unified approach to domination problems on interval graphs

0 references

The weighted perfect domination problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4820130

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10637199508915531
+Normal rank
@@ Property / OpenAlex ID @@
+W2090219467
@@ Property / OpenAlex ID: W2090219467 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3206969
@@ Property / cites work: Q3206969 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect codes in graphs
@@ Property / cites work: Perfect codes in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-theoretic parameters concerning domination, independence, and irredundance
+Normal rank
@@ Property / cites work @@
+Towards a theory of domination in graphs
@@ Property / cites work: Towards a theory of domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient edge domination problems in graphs
@@ Property / cites work: Efficient edge domination problems in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees, connected domination and strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+A new upper bound on the complexity of the all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Q3291034
@@ Property / cites work: Q3291034 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to domination problems on interval graphs
+Normal rank
@@ Property / cites work @@
+The weighted perfect domination problem
@@ Property / cites work: The weighted perfect domination problem / rank @@
+Normal rank