Relevant bibliographies by topics / D-partition

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'D-partition'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'D-partition.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "D-partition"

1

Alghamdi, Wajdi, and Muhammad Ahsan Asim. "On the Bounded Partition Dimension of Some Generalised Graph Structures." Journal of Mathematics 2022 (December 5, 2022): 1–11. http://dx.doi.org/10.1155/2022/9531182.

Full text
Abstract:
Consider λ to be a connected graph with a vertex set V λ that may be partitioned into any partition set S . If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ . . A partition dimension of λ , represented by p d , is the minimal cardinality of resolving k partitions of V λ . The partition dimension of various generalised families of graphs, such as the Harary graph, Cayley graph, and Pendent graph, is given as a sharp upper bound in this article.
APA, Harvard, Vancouver, ISO, and other styles
2

MULZER, WOLFGANG, and YANNIK STEIN. "ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS." International Journal of Computational Geometry & Applications 24, no. 04 (2014): 261–73. http://dx.doi.org/10.1142/s0218195914600073.

Full text
Abstract:
Let P be a d-dimensional n-point set. A partition [Formula: see text] of P is called a Tverberg partition if the convex hulls of all sets in [Formula: see text] intersect in at least one point. We say that [Formula: see text] is t-tolerant if it remains a Tverberg partition after deleting any t points from P. Soberón and Strausz proved that there is always a t-tolerant Tverberg partition with ⌈n/(d + 1)(t + 1)⌉ sets. However, no nontrivial algorithms for computing or approximating such partitions have been presented so far. For d ≤ 2, we show that the Soberón-Strausz bound can be improved, and
APA, Harvard, Vancouver, ISO, and other styles
3

Azhar, Kamran, Sohail Zafar, Agha Kashif, and Zohaib Zahid. "On fault-tolerant partition dimension of graphs." Journal of Intelligent & Fuzzy Systems 40, no. 1 (2021): 1129–35. http://dx.doi.org/10.3233/jifs-201390.

Full text
Abstract:
Fault-tolerant resolving partition is natural extension of resolving partitions which have many applications in different areas of computer sciences for example sensor networking, intelligent systems, optimization and robot navigation. For a nontrivial connected graph G (V (G) , E (G)), the partition representation of vertex v with respect to an ordered partition Π = {Si : 1 ≤ i ≤ k} of V (G) is the k-vector r ( v | Π ) = ( d ( v , S i ) ) i = 1 k , where, d (v, Si) = min {d (v, x) |x ∈ Si}, for i ∈ {1, 2, …, k}. A partition Π is said to be fault-tolerant partition resolving set of G if r (u|Π
APA, Harvard, Vancouver, ISO, and other styles
4

Józefiak, Tadeusz, and Jerzy Weyman. "Representation-theoretic interpretation of a formula of D. E. Littlewood." Mathematical Proceedings of the Cambridge Philosophical Society 103, no. 2 (1988): 193–96. http://dx.doi.org/10.1017/s0305004100064768.

Full text
Abstract:
This note is a continuation of our attempts (see [3]) to give a satisfactory representation-theoretic justification of the following formula of D. E. Littlewood:where sI is the Schur symmetric function corresponding to a partition I, |I| is the weight of I, r(I) is the rank of I, and the summation ranges over all self-conjugate partitions (i.e. partitions I such that I = I where I is the partition conjugate to I).
APA, Harvard, Vancouver, ISO, and other styles
5

Hwang, Chyi, Li‐Fong Hwang, and Jyh‐Haur Hwang. "Robust D‐partition." Journal of the Chinese Institute of Engineers 33, no. 6 (2010): 811–21. http://dx.doi.org/10.1080/02533839.2010.9671671.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gramain, Jean-Baptiste, and Jørn B. Olsson. "On bar lengths in partitions." Proceedings of the Edinburgh Mathematical Society 56, no. 2 (2013): 535–50. http://dx.doi.org/10.1017/s0013091512000387.

Full text
Abstract:
AbstractWe present, given an odd integer d, a decomposition of the multiset of bar lengths of a bar partition λ as the union of two multisets, one consisting of the bar lengths in its d-core partition cd(λ) and the other consisting of modified bar lengths in its d-quotient partition. In particular, we obtain that the multiset of bar lengths in cd(λ) is a sub-multiset of the multiset of bar lengths in λ. Also, we obtain a relative bar formula for the degrees of spin characters of the Schur extensions of $\mathfrak{S}_n$. The proof involves a recent similar result for partitions, proved by Besse
APA, Harvard, Vancouver, ISO, and other styles
7

Last, Günter. "Stationary partitions and Palm probabilities." Advances in Applied Probability 38, no. 03 (2006): 602–20. http://dx.doi.org/10.1017/s0001867800001191.

Full text
Abstract:
A stationary partition based on a stationary point process N in ℝ d is an ℝ d -valued random field π={π(x): x∈ℝ d } such that both π(y)∈N for each y∈ℝ d and the random partition {{y∈ℝ d : π(y)=x}: x∈N} is stationary jointly with N. Stationary partitions may be considered as general versions of the stationary random tessellations studied in stochastic geometry. As in the special case of the Voronoi tessellation, a stationary partition can be used to relate the underlying stationary probability measure to the associated Palm probability measure of N. In doing so, we will develop some basic theor
APA, Harvard, Vancouver, ISO, and other styles
8

Dockery, Dalen, Marie Jameson, James A. Sellers, and Samuel Wilson. "d-fold partition diamonds." Discrete Mathematics 347, no. 12 (2024): 114163. http://dx.doi.org/10.1016/j.disc.2024.114163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hansen, Jennie C. "A functional central limit theorem for the Ewens sampling formula." Journal of Applied Probability 27, no. 1 (1990): 28–43. http://dx.doi.org/10.2307/3214593.

Full text
Abstract:
For each n > 0, the Ewens sampling formula from population genetics is a measure on the set of all partitions of the integer n. To determine the limiting distributions for the part sizes of a partition with respect to the measures given by this formula, we associate to each partition a step function on [0, 1]. Each jump in the function equals the number of parts in the partition of a certain size. We normalize these functions and show that the induced measures on D[0, 1] converge to Wiener measure. This result complements Kingman's frequency limit theorem [10] for the Ewens partition struct
APA, Harvard, Vancouver, ISO, and other styles
10

Hansen, Jennie C. "A functional central limit theorem for the Ewens sampling formula." Journal of Applied Probability 27, no. 01 (1990): 28–43. http://dx.doi.org/10.1017/s0021900200038407.

Full text
Abstract:
For each n > 0, the Ewens sampling formula from population genetics is a measure on the set of all partitions of the integer n. To determine the limiting distributions for the part sizes of a partition with respect to the measures given by this formula, we associate to each partition a step function on [0, 1]. Each jump in the function equals the number of parts in the partition of a certain size. We normalize these functions and show that the induced measures on D[0, 1] converge to Wiener measure. This result complements Kingman's frequency limit theorem [10] for the Ewens partition st
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "D-partition"

1

Mendez, Barrios César. "Low-Order Controllers for Time-Delay Systems : an Analytical Approach." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00719477.

Full text
Abstract:
The research work presented in this thesis concern to the stability analysis of linear time-delay systems with low-order controllers. This thesis is divided into three parts.The first part of the thesis focus on the study of linear SISO (single-input/single-output) systems with input/output delays, where the feedback loop is closed with a controller of PID-type. Inspired by the geometrical approach developed by Gu et al. we propose an analytical method to find the stability regions of all stabilizing controllers of PID-type for the time-delay system. Based on this same approach, we propose an
APA, Harvard, Vancouver, ISO, and other styles
2

Kim, Jinho. "Représentation et analyse musicale assistée par base de données relationnelle de la partition des variations pour orchestre op. 30 d'Anton Webern : vers un système d'"analyse musicale assistée par base de données relationnelle"." Paris 4, 2006. http://www.theses.fr/2006PA040004.

Full text
Abstract:
Une note présente dans une partition, comme d'autres objets musicaux d'ailleurs, peut être considérée comme étant une entité possédant des propriétés qui peuvent être représentées par des valeurs élémentaires et stockées dans les différentes colonnes d'une même ligne d'une table de base de données relationnelle. La représentation de toutes les notes dans la partition sous forme de tables qui constituent un ensemble de colonnes et de lignes facilite grandement l'accès au caractère ouvert de l'analyse musicale : en effet chacun peut, en fonction de sa propre problématique, interroger la base de
APA, Harvard, Vancouver, ISO, and other styles
3

Weinert, Thilo Volker [Verfasser]. "A Potpourri of Partition Properties / Thilo Weinert." Bonn : Universitäts- und Landesbibliothek Bonn, 2014. http://d-nb.info/1057915084/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sullivan, Timothy. "Terrains, for orchestra." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0001/NQ41088.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Adelmann, Stephan [Verfasser]. "On Hydrodynamics in Centrifugal Partition Chromatography / Stephan Adelmann." München : Verlag Dr. Hut, 2014. http://d-nb.info/1053859562/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hermeling, Maike [Verfasser]. "Partition von gasgetragenen Nanopartikeln in Modellblasensäulen / Maike Hermeling." Clausthal-Zellerfeld : Universitätsbibliothek Clausthal, 2011. http://d-nb.info/1010235257/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schneider, René [Verfasser]. "Iterative Partition-Based Moving-Horizon State Estimation / René Schneider." Aachen : Shaker, 2017. http://d-nb.info/1138178179/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Mingming. "Development of the partition of unity finite element method for the numerical simulation of interior sound field." Thesis, Compiègne, 2016. http://www.theses.fr/2016COMP2282/document.

Full text
Abstract:
Dans ce travail, nous avons introduit le concept sous-jacent de PUFEM et la formulation de base lié à l'équation de Helmholtz dans un domaine borné. Le processus d'enrichissement de l'onde plane de variables PUFEM a été montré et expliqué en détail. L'idée principale est d'inclure une connaissance a priori sur le comportement local de la solution dans l'espace des éléments finis en utilisant un ensemble de fonctions d'onde qui sont des solutions aux équations aux dérivées partielles. Dans cette étude, l'utilisation des ondes planes se propageant dans différentes directions a été favorisée car
APA, Harvard, Vancouver, ISO, and other styles
9

Krause, Jonas Frederik [Verfasser]. "Biocatalytic Conversions in a Centrifugal Partition Chromatograph / Jonas Frederik Krause." München : Verlag Dr. Hut, 2018. http://d-nb.info/1155057791/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Perron, Alain. "Duo concertant ; : Dorléac ; Relevés no. 7 ; Séquences voilées ; Double éclat : œuvres musicales." Master's thesis, Université Laval, 1992. http://hdl.handle.net/20.500.11794/28621.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "D-partition"

1

Laporte-Castède, Georgette. Chants de noce dans les landes de Gascogne: Partitions de musique traditionelle par D. Betuing, J. Labèque, G. Lamoulie, G. Rémazeilles. Princi Negue, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

A basis for using fire modeling with 1-D thermal analyses of barriers/partitions to simulate 2-D and 3-D barrier/partition structural performance in real fires. U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

(Editor), Graham Haughton, and Colin C. Williams (Editor), eds. Corporate City?: Partnership, Participation and Partition in Urban Development in Leeds (Urban and Regional Planning and Development D). Avebury, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Smedley, Edward. History of France, Vol. 1: From the Final Partition of the Empire of Charlemagne, A. D. 843, to the Peace of Cambray, A. D. 1529 (Classic Reprint). Forgotten Books, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Borodin, Alexei, and Leonid Petrov. Integrable probability: stochastic vertex models and symmetric functions. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198797319.003.0002.

Full text
Abstract:
This chapter presents the study of a homogeneous stochastic higher spin six-vertex model in a quadrant. For this model concise integral representations for multipoint q-moments of the height function and for the q-correlation functions are derived. At least in the case of the step initial condition, these formulas degenerate in appropriate limits to many known formulas of such type for integrable probabilistic systems in the (1+1)d KPZ universality class, including the stochastic six-vertex model, ASEP, various q-TASEPs, and associated zero-range processes. The arguments are largely based on p
APA, Harvard, Vancouver, ISO, and other styles
6

Gardner, Lloyd C. Spheres of Influence: The Great Powers Partition Europe, From Munich to Yalta. Ivan R. Dee, Publisher, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Burton, Robert. The Anatomy of Melancholy: What It Is, With All the Kinds, Causes, Symptoms, Prognostics, and Several Cures of It. in Three Partitions. With Their ... Historically Opened and Cut Up. by D. Arkose Press, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Burton, Robert. Anatomy of Melancholy: What It Is, with All the Kinds, Causes, Symptoms, Prognostics, and Several Cures of It. in Three Partitions. with Their Several Sections, Members, and Subsections, Philosophically, Medically, Historically Opened and Cut up. by D. Creative Media Partners, LLC, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "D-partition"

1

Chen, Danny Z., and Ewa Misiołek. "Free-Form Surface Partition in 3-D." In Algorithms and Computation. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92182-0_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ding, Qiang, Ke Xu, and Hui-shan Liu. "Construct Optimal Diameter Network and d-partition Routing Algorithm." In Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576259_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Neimark, Juri I. "Mathematical model as a fruitful idea of research. The D-partition." In Foundations of Engineering Mechanics. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-47878-2_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Azuela, Juan Humberto Sossa, Francisco Cuevas de la Rosa, and Héctor Benitez. "Efficient Computation of 3-D Moments in Terms of an Object’s Partition." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-70659-3_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Padrón, Miguel A., and Ángel Plaza. "The 8T-LE Partition Applied to the Barycentric Division of a 3-D Cube." In Lecture Notes in Computational Science and Engineering. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55874-1_74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yu, Hai-Yan, and Jiu-Lun Fan. "Three-Level Image Segmentation Based on Maximum Fuzzy Partition Entropy of 2-D Histogram and Quantum Genetic Algorithm." In Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85984-0_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xie, Yuehong, Weiqin Ying, Yu Wu, Bingshen Wu, Shiyun Chen, and Weipeng He. "Partitioned Parallelization of MOEA/D for Bi-objective Optimization on Clusters." In Communications in Computer and Information Science. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0356-1_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jones, Keith John. "Parallel Reordering and Transfer of Data Between Partitioned Memories of Discrete Hartley for 1-D and m-D Cases." In The Regularized Fast Hartley Transform. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68245-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dai, Jianing, Yulin Yan, Erhao Li, Zhengyu Gong, Ling Zhang, and Zhixing Gu. "Study on the 3-D Natural Circulation Characteristics of LFR Under Steady State by Using Ansys Fluent." In Springer Proceedings in Physics. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-1023-6_79.

Full text
Abstract:
AbstractAs one of the Generation IV reactors, Lead-based Fast Reactor (LFR) has been considered to be great promising owing to its advantages in nuclear safety, sustainable development of nuclear energy and nuclear waste disposal. Owing to the excellent thermal expansion characteristics of Lead-based coolant materials, the primary cooling system of LFR can operate in natural circulation driven mode. The CFD (Computational Fluid Dynamics)-based thermal-hydraulics and safety analyses of nuclear reactors, especially liquid metal pool-type reactors have attracted great attentions in recent years.
APA, Harvard, Vancouver, ISO, and other styles
10

Sun, Jiachang. "Multi-color Difference Schemes of Helmholtz Equation and Its Parallel Fast Solver over 3-D Dodecahedron Partitions." In Distributed and Parallel Computing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "D-partition"

1

Long, Yi, Yonghao Li, Boxin Liu, Cong Chen, Xin Xiang, and Wuhua Li. "Stability Boundary Characterization and Inner Loop Controller Design for Grid Forming Converters Based on D-Partition Method." In 2024 CPSS & IEEE International Symposium on Energy Storage and Conversion (ISESC). IEEE, 2024. https://doi.org/10.1109/isesc63657.2024.10785376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sambinelli, M., C. N. Lintzmayer, C. N. Da Silva, and O. Lee. "Vertex partition problems in digraphs ⇤." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3174.

Full text
Abstract:
Let D be a digraph and k be a positive integer. Linial (1981) conjectured that the k-norm of a k-minimum path partition of a digraph D is at most max{PC2 C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it. It is well known that Berge's Conjecture implies Linial's Conjecture. In this work, we verify Berge's Conjecture, and consequently Linial's Conjecture, for locally in-semicomplete digraphs and k-minimum path partitions containing only two paths. Moreover, we verify a conjecture related to Berge'
APA, Harvard, Vancouver, ISO, and other styles
3

Sleiti, A. K., and Ranganathan Kumar. "Effect of Vent Aspect Ratio on Unsteady Laminar Buoyant Flow Through Rectangular Vents in Large Enclosures." In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-81604.

Full text
Abstract:
The effects of vent aspect ratio on oscillatory flow regime through a horizontal opening were studied numerically. The physical model consisted of a vertical rectangular enclosure divided into two chambers by a horizontal partition. The partitions contained a slot that connected the two chambers. The upper chamber contains cold air and the lower chamber contains hot air. A density differential due to the different temperatures drives the interaction between the two chambers. The opposing forces at the interface between the two chambers create a gravitationally unstable system, and an oscillati
APA, Harvard, Vancouver, ISO, and other styles
4

Cruz, Jadder Bismarck de Sousa, Cândida Nunes da Silva, and Orlando Lee. "Some Partial Results on Linial's Conjecture for Matching-Spine Digraphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16386.

Full text
Abstract:
Let $k$ be a positive integer. A \emph{partial $k$-coloring} of a digraph $D$ is a set $\calC$ of $k$ disjoint stable sets and has \emph{weight} defined as $\sum_{C \in \calC} |C|$. An \emph{optimal} $k$-coloring is a $k$-coloring of maximum weight. A \emph{path partition} of a digraph $D$ is a set $\calP$ of disjoint paths of $D$ that covers its vertex set and has \emph{$k$-norm} defined as $\sum_{P \in \mathcal{P}} \min\{|P|,k\}$. A path partition $\calP$ is \emph{$k$-optimal} if it has minimum $k$-norm. A digraph $D$ is \emph{matching-spine} if its vertex set can be partitioned into sets $X
APA, Harvard, Vancouver, ISO, and other styles
5

Riera, Pablo E., and Manuel C. Eguía. "Flexible Solver For 1-D Cochlear Partition Simulations." In 171st Meeting of the Acoustical Society of America. Acoustical Society of America, 2016. http://dx.doi.org/10.1121/2.0000437.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hong, Dohy. "D-iteration: Evaluation of a Dynamic Partition Strategy." In 2012 IEEE 14th Int'l Conf. on High Performance Computing and Communication (HPCC) & 2012 IEEE 9th Int'l Conf. on Embedded Software and Systems (ICESS). IEEE, 2012. http://dx.doi.org/10.1109/hpcc.2012.143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fan, Xuhui, Bin Li, Ling Luo, and Scott A. Sisson. "Bayesian Nonparametric Space Partitions: A Survey." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/602.

Full text
Abstract:
Bayesian nonparametric space partition (BNSP) models provide a variety of strategies for partitioning a D-dimensional space into a set of blocks, such that the data within the same block share certain kinds of homogeneity. BNSP models are applicable to many areas, including regression/classification trees, random feature construction, and relational modelling. This survey provides the first comprehensive review of this subject. We explore the current progress of BNSP research through three perspectives: (1) Partition strategies, where we review the various techniques for generating partitions
APA, Harvard, Vancouver, ISO, and other styles
8

Sambinelli, M., C. N. Da Silva, and O. Lee. "Diperfect Digraphs." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3173.

Full text
Abstract:
Let D be a digraph. A path partition P of D is a collection of paths such that {V (P ) : P 2 P } is a partition of V (D). We say D is ↵ -diperfect if for every maximum stable set S of D there exists a path partition P of D such that |S \ V (P )| = 1 for all P 2 P and this property holds for every induced subdigraph of D. A digraph C is an anti-directed odd cycle if (i) the underlying graph of C is a cycle x1x2 · · · x2k+1x1, where k 2, (ii) the longest path in C has length 2, and (iii) each of the vertices x1, x2, x3, x4, x6, x8, . . . , x2k is either a source or a sink. Berge (1982) conjectur
APA, Harvard, Vancouver, ISO, and other styles
9

Jinggong, Liu, Xue Yali, and Li Donghai. "Calculation of PI controller stable region based on D-partition method." In 2010 International Conference on Control, Automation and Systems (ICCAS 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccas.2010.5669858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Carvalho, Vinícius De Souza, Cândida Nunes Da Silva, and Orlando Lee. "Linial's Dual Conjecture for Path-Spine Digraphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11098.

Full text
Abstract:
Given a digraph D, a coloring 𝒞 of D is a partition of V(D) into stable sets. The k-norm of 𝒞 is defined as ΣC∈𝒞 min{|C|, k}. A coloring of D with minimum k-norm has its k-norm noted by χk(D). A (path)-k-pack of a digraph D is a set of k vertex-disjoint (directed) paths of D. The weight of a k-pack is the number of vertices covered by the k-pack. We denote by λk(D) the weight of a maximum k-pack. Linial conjectured that χk(D) ≤ λk(D) for every digraph. Such conjecture remains open, but has been proved for some classes of digraphs. We prove the conjecture for path-spine digraphs, defined as fol
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'D-partition' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography