The permutation-path coloring problem on trees. (Q1401295): Difference between revisions

@@ Property / author @@
+Daniéle Gardy
@@ Property / author: Daniéle Gardy / rank @@
+Normal rank
@@ Property / author @@
+Dominique Barith
@@ Property / author: Dominique Barith / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886092
@@ Property / cites work: Q4886092 / rank @@
+Normal rank
@@ Property / cites work @@
+Permutations depending on the exceedance type and the number of inversions and combinatorial interpretation of a continued fraction of Heine
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres
+Normal rank
@@ Property / cites work @@
+The maximum of a random walk whose mean path has a maximum
+Normal rank
@@ Property / cites work @@
+Optimal wavelength routing on directed fiber trees
+Normal rank
@@ Property / cites work @@
+Combinatorial aspects of continued fractions
@@ Property / cites work: Combinatorial aspects of continued fractions / rank @@
+Normal rank
@@ Property / cites work @@
+Eulerian graphs and related topics. Part 1, Volume 2
+Normal rank
@@ Property / cites work @@
+Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
+Normal rank
@@ Property / cites work @@
+Dynamic analysis of some relational databases parameters
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Colouring paths in directed symmetric trees with applications to WDM routing
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Routing a permutation in the hypercube by two sets of edge disjoint paths
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+A note on optical routing on trees
@@ Property / cites work: A note on optical routing on trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the capacity of disjointly shared networks
@@ Property / cites work: On the capacity of disjointly shared networks / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks, Gaussian processes and list structures
+Normal rank
@@ Property / cites work @@
+The maximum concurrent flow problem
@@ Property / cites work: The maximum concurrent flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient routing in all-optical networks
@@ Property / cites work: Efficient routing in all-optical networks / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring a Family of Circular Arcs
@@ Property / cites work: Coloring a Family of Circular Arcs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3715122
@@ Property / cites work: Q3715122 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250199
@@ Property / cites work: Q4250199 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(02)00635-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1992627018
@@ Property / OpenAlex ID: W1992627018 / rank @@
+Normal rank