Relevant bibliographies by topics / Digraphe

Contents

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

Academic literature on the topic 'Digraphe'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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 'Digraphe.'

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 "Digraphe"

1

Johnson, Peter D. "Unordered Love in infinite directed graphs." International Journal of Mathematics and Mathematical Sciences 15, no. 4 (1992): 753–56. http://dx.doi.org/10.1155/s0161171292000978.

Full text
Abstract:
A digraphD=(V,A)has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both(V,A)and(V,A−1)have the ULP, we say thatDhas the SDULP.A love-master inDis a vertexν0connected both ways to every other vertex, such thatD−ν0is a disjoint union of directed cycles.The following results, more or less well-known for finite digraphs, are proven here forDinfinite: (i) ifDis loopless and has the SDULP, then eitherDhas a love-master, orDis associable with a projective plane, obtainable by takingVas the set of points and the sets of outneighbors of vertices as
APA, Harvard, Vancouver, ISO, and other styles
2

Luo, Mei Jin. "The Upper Bound of Primitive Exponent of a Class of Special Nonnegative Matrix Pairs." Advanced Materials Research 1061-1062 (December 2014): 1100–1103. http://dx.doi.org/10.4028/www.scientific.net/amr.1061-1062.1100.

Full text
Abstract:
There is a one-to-one relationship between nonnegative matrix pairs and two-colored digraph. With the knowledge of graph theory, by studying the associated directed digraph of a class of special nonnegative matrix pairs, that is a class of two-colored digraphs whose uncolored digraph have 3n-1 vertices and consists of one (3n-1)-cycle and one n-cycle are considered. The exponent and characteristic of extreme two-colored digraphs are given.
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Xiuliang, and Haobo Yang. "ISOMORPHISMS OF TRANSFORMATION SEMIGROUPS ASSOCIATED WITH SIMPLE DIGRAPHS." Asian-European Journal of Mathematics 02, no. 04 (2009): 727–37. http://dx.doi.org/10.1142/s1793557109000601.

Full text
Abstract:
For each simple digraph D, we introduce its associated semigroup S(D) and its widened digraph W(D). We show that, for any two finite simple digraphs D1 and D2, S(D1) and S(D2) are isomorphic as semigroups if and only if W(D1) and W(D2) are isomorphic as digraphs.
APA, Harvard, Vancouver, ISO, and other styles
4

RUAN, LU, SHITOU HAN, DEYING LI, HUNG Q. NGO, and SCOTT C. H. HUANG. "TRANSMISSION FAULT-TOLERANCE OF ITERATED LINE DIGRAPHS." Journal of Interconnection Networks 05, no. 04 (2004): 475–87. http://dx.doi.org/10.1142/s021926590400126x.

Full text
Abstract:
The main result of this paper states that, if every cyclic modification of a d-regular digraph has super line-connectivity d, then the line digraph also has super line-connectivity d. Since many well-known interconnection network topologies, such as the Kautz digraphs, the de Bruijn digraphs, etc., can be constructed by iterating the line digraph construction, our result leads to several known and new connectivity results for these topologies, as shown later in the paper.
APA, Harvard, Vancouver, ISO, and other styles
5

Luo, Mei Jin. "The Primitive Exponent of a Class of Special Nonnegative Matrix Pairs." Advanced Materials Research 915-916 (April 2014): 1296–99. http://dx.doi.org/10.4028/www.scientific.net/amr.915-916.1296.

Full text
Abstract:
There is a one-to-one relationship between nonnegative matrix pairs and two-colored digraph, so the problem of matrices can be changed into that of graphics to be solved. With the knowledge of graph theory, by studying the associated directed digraph of a class of special nonnegative matrix pairs, that is a class of two-colored digraphs whose uncolored digraph have vertices and consists of one-cycle and one-cycle are considered. The exponent and characteristic of extreme two-colored digraphs are given.
APA, Harvard, Vancouver, ISO, and other styles
6

FERRARA, MICHAEL, MICHAEL JACOBSON, and FLORIAN PFENDER. "Degree Conditions for H-Linked Digraphs." Combinatorics, Probability and Computing 22, no. 5 (2013): 684–99. http://dx.doi.org/10.1017/s0963548313000278.

Full text
Abstract:
Given a (multi)digraph H, a digraph D is H-linked if every injective function ι:V(H) → V(D) can be extended to an H-subdivision. In this paper, we give sharp degree conditions that ensure a sufficiently large digraph D is H-linked for arbitrary H. The notion of an H-linked digraph extends the classes of m-linked, m-ordered and strongly m-connected digraphs.First, we give sharp minimum semi-degree conditions for H-linkedness, extending results of Kühn and Osthus on m-linked and m-ordered digraphs. It is known that the minimum degree threshold for an undirected graph to be H-linked depends on a
APA, Harvard, Vancouver, ISO, and other styles
7

Božović, Dragana, and Iztok Peterin. "Efficient Open Domination in Digraph Products." Mathematics 8, no. 4 (2020): 496. http://dx.doi.org/10.3390/math8040496.

Full text
Abstract:
A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partition of V ( D ) . In this work we deal with the efficient open domination digraphs among four standard products of digraphs. We present a method for constructing the efficient open domination Cartesian product of digraphs with one fixed factor. In particular, we characterize those for which the first factor has an underlying graph that is a path, a cycle or a star. We also characterize the efficient open domination strong produ
APA, Harvard, Vancouver, ISO, and other styles
8

Alsatami, Khalid A., Hong-Jian Lai, and Xindong Zhang. "Dicycle Cover of Hamiltonian Oriented Graphs." Journal of Discrete Mathematics 2016 (February 3, 2016): 1–5. http://dx.doi.org/10.1155/2016/7942192.

Full text
Abstract:
A dicycle cover of a digraph D is a family F of dicycles of D such that each arc of D lies in at least one dicycle in F. We investigate the problem of determining the upper bounds for the minimum number of dicycles which cover all arcs in a strong digraph. Best possible upper bounds of dicycle covers are obtained in a number of classes of digraphs including strong tournaments, Hamiltonian oriented graphs, Hamiltonian oriented complete bipartite graphs, and families of possibly non-Hamiltonian digraphs obtained from these digraphs via a sequence of 2-sum operations.
APA, Harvard, Vancouver, ISO, and other styles
9

Harutyunyan, Ararat, P. Mark Kayll, Bojan Mohar, and Liam Rafferty. "Uniquely D-colourable Digraphs with Large Girth." Canadian Journal of Mathematics 64, no. 6 (2012): 1310–28. http://dx.doi.org/10.4153/cjm-2011-084-9.

Full text
Abstract:
Abstract Let C and D be digraphs. A mapping f : V(D) →V(C) is a C-colouring if for every arc uv of D, either f (u) f (v) is an arc of C or f (u) = f (v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely C-colourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphism of C. We prove that if a digraph D is not C-colourable, then there exist digraphs of arbitrarily large girth that are D-colourable but not C-colourable. Moreover, for every digraph D that
APA, Harvard, Vancouver, ISO, and other styles
10

Honda, Keisuke. "Kana digraphs and morea." Written Language and Literacy 10, no. 1 (2007): 65–82. http://dx.doi.org/10.1075/wll.10.1.05hon.

Full text
Abstract:
The Japanese kana script represents morae by assigning either graphs or digraphs. Kana digraphs are characteristic in that they each comprise two mora-bearing graphs and yet correspond to single morae. This paper develops a structural analysis of kana digraphs, in which the monomoraic value of every digraph is consistently derived from the bimoraic value of a two-graph string. It is argued that the derivational process involves two events, namely cancellation of moraicity in the first mora and amalgamation of all relevant segments into the resultant single mora. This accounts for the observed
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Digraphe"

1

Montalva, Medel Marco. "Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation." Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00629549.

Full text
Abstract:
Dans la nature existent de nomreux exemples de systèmes dynamiques complexes: systèmes neuronaux, communautés, écosystèmes, réseaux de régulation génétiques, etc. Ces derniers, en particulier, sont de notre intérêt et sont souvent modélisés par des réseaux booléens. Un réseau booléenne peut être considérée comme un digraphe, où les sommets correspondent à des gènes ou de produits de gènes, tandis que les arcs indiquent les interactions entre eux. Une niveau d'expression des gènes est modélisé par des valeurs binaires, 0 ou 1, indiquant deux états de la transcription, soit activité, soit inacti
APA, Harvard, Vancouver, ISO, and other styles
2

Bessy, Stéphane. "Stabilité et décomposition en circuits d'un digraphe." Lyon 1, 2003. http://www.theses.fr/2003LYO10264.

Full text
Abstract:
En 1963, T. Gallai conjectura que les sommets de tout digraphe fortement connexe D peuvent être couverts par au plus alpha(D) circuits, où alpha(D) désigne la stabilité de D. Cette thèse présente une preuve de cette conjecture obtenue conjointement avec S. Thomassé et pour laquelle de nouvelles structures combinatoires sont introduites: les ordres cycliques pour digraphes fortement connexes. Un second résultat est présenté: pour un digraphe fortement connexe D, il existe au plus 2. Alpha(D)-1 circuits couvrant le digraphe D et dont l'union est fortement connexe et possède au plus |D|+2. Alpha(
APA, Harvard, Vancouver, ISO, and other styles
3

Oliveira, Ana Karolinna Maia de. "Subdivisions de digraphes." Thesis, Nice, 2014. http://www.theses.fr/2014NICE4084/document.

Full text
Abstract:
Dans ce travail, nous considérons le problème suivant : étant donné un graphe orienté D, contient-il une subdivision d’un digraphe fixé F ? Nous pensons qu’il existe une dichotomie entre les instances polynomiales et NP-complètes. Nous donnons plusieurs exemples pour les deux cas. En particulier, sauf pour cinq instances, nous sommes capable de classer tous les digraphes d’ordre 4. Alors que toutes les preuves NP-complétude sont faites par réduction de une version du problème 2-linkage en digraphes, nous utilisons différents outils algorithmiques pour prouver la solvabilité en temps polynomial
APA, Harvard, Vancouver, ISO, and other styles
4

Ghazal, Salman. "Étude de la conjecture de Seymour sur le second voisinage." Phd thesis, Université Claude Bernard - Lyon I, 2011. http://tel.archives-ouvertes.fr/tel-00744560.

Full text
Abstract:
Soit D un digraphe simple (sans cycle orienté de longueur 2 ). En 1990, P. Seymour a conjecturé que D a un sommet v avec un second voisinage extérieur au moins aussi grand que son (premier) voisinage extérieur [1]. Cette conjecture est connue sous le nom de la conjecture du second voisinage du Seymour (SNC). Cette conjecture, si elle est vraie, impliquerait, un cas spécial plus faible (mais important) de la conjecture de Caccetta et Häggkvist [2] proposé en 1978 : tout digraphe D avec un degré extérieur minimum au moins égale à jV (D)j=k a un cycle orienté de longueur au plus k. Le cas particu
APA, Harvard, Vancouver, ISO, and other styles
5

Shen, Jian. "Exponents of primitive digraphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0014/NQ31954.pdf.

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

Smith, Heather Christina. "Zero Divisors among Digraphs." VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2120.

Full text
Abstract:
This thesis generalizes to digraphs certain recent results about graphs. There are special digraphs C such that AxC is isomorphic to BxC for some pair of distinct digraphs A and B. Lovasz named these digraphs C zero-divisors and completely characterized their structure. Knowing that all directed cycles are zero-divisors, we focus on the following problem: Given any directed cycle D and any digraph A, enumerate all digraphs B such that AxD is isomorphic to BxD. From our result for cycles, we generalize to an arbitrary zero-divisor C, developing upper and lower bounds for the collection of digra
APA, Harvard, Vancouver, ISO, and other styles
7

Jahanbakht, Nafiseh, and University of Lethbridge Faculty of Arts and Science. "Energy of graphs and digraphs." Thesis, Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2010, 2010. http://hdl.handle.net/10133/2489.

Full text
Abstract:
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the energy of a class of molecules in chemistry and was first brought to mathematics by Gutman in 1978 ([8]). In this thesis, we do a comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs are proved to be hyper-energetic. We find
APA, Harvard, Vancouver, ISO, and other styles
8

Young, Andrew Christopher. "Extremal Problems for Dense Digraphs." Thesis, University of Birmingham, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.522060.

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

Moura, Phablo Fernando Soares. "Graph colorings and digraph subdivisions." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/.

Full text
Abstract:
The vertex coloring problem is a classic problem in graph theory that asks for a partition of the vertex set into a minimum number of stable sets. This thesis presents our studies on three vertex (re)coloring problems on graphs and on a problem related to a long-standing conjecture on subdivision of digraphs. Firstly, we address the convex recoloring problem in which an arbitrarily colored graph G is given and one wishes to find a minimum weight recoloring such that each color class induces a connected subgraph of G. We show inapproximability results, introduce an integer linear programming (I
APA, Harvard, Vancouver, ISO, and other styles
10

Gleiss, Petra M., Josef Leydold, and Peter F. Stadler. "Circuit Bases of Strongly Connected Digraphs." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/178/1/document.pdf.

Full text
Abstract:
The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Digraphe"

1

Bang-Jensen, Jørgen, and Gregory Gutin. Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0.

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

Bang-Jensen, Jørgen, and Gregory Z. Gutin. Digraphs. Springer London, 2009. http://dx.doi.org/10.1007/978-1-84800-998-1.

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

Linda, Lesniak, ed. Graphs & digraphs. 4th ed. Chapman & Hall/CRC, 2005.

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

Linda, Lesniak, and Behzad Mehdi, eds. Graphs & digraphs. 2nd ed. Wadsworth & Brooks/Cole Advanced Books & Software, 1986.

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

Linda, Lesniak, and Zhang Ping 1957-, eds. Graphs & digraphs. 5th ed. Chapman and Hall/CRC, 2010.

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

Volkmann, Lutz. Graphen und Digraphen. Springer Vienna, 1991. http://dx.doi.org/10.1007/978-3-7091-9144-6.

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

Company, Steck-Vaughn, ed. Blends and digraphs: Sn. Steck-Vaughn Co., 2002.

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

Company, Steck-Vaughn, ed. Blends and digraphs: Fl. Steck-Vaughn Co., 2002.

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

Company, Steck-Vaughn, ed. Blends and digraphs: Sp. Steck-Vaughn Co., 2002.

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

Muller, Stephanie. Blends and digraphs: Ch. Edited by Steck-Vaughn Company. Steck-Vaughn Co., 2002.

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

Book chapters on the topic "Digraphe"

1

Bang-Jensen, Jørgen, and Gregory Gutin. "Basic Terminology, Notation and Results." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_1.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Cycle Structure of Digraphs." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_10.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Generalizations of Digraphs." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_11.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Additional Topics." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_12.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Distances." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_2.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Flows in Networks." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_3.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Classes of Digraphs." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_4.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Hamiltonicity and Related Problems." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_5.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Hamiltonian Refinements." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_6.

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

Bang-Jensen, Jørgen, and Gregory Gutin. "Global Connectivity." In Digraphs. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-3886-0_7.

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

Conference papers on the topic "Digraphe"

1

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
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

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
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

Silva, Caroline, Cândida Silva, and Orlando Lee. "A proof for Berges Dual Conjecture for Bipartite Digraphs." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6398.

Full text
Abstract:
Given a (vertex)-coloring C = C 1 , C 2 , ...C m of P a digraph D and a positive integer k, the k-norm of C is defined as C k = m i=1 min C i, k. A coloring C is k-optimal if its k-norm C k is minimum over all colorings. A (path) k-pack P k is a collection of at most k vertex-disjoint paths. A coloring C and a k-pack P k are orthogonal if each color class intersects as many paths as possible in P k , that is, if C i k, C i P j = 1 for every path P j P k , otherwise each vertex of C i lies in a different path of P k . In 1982, Berge conjectured that for every k-optimal coloring C there is a k-p
APA, Harvard, Vancouver, ISO, and other styles
6

Franco, Álvaro J. P., and Marcelo E. Vendramin. "Super-colored paths in digraphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16389.

Full text
Abstract:
We work in an Anthropology application where it is desired to enumerate colored rings (structures that look like cycles) present in kinship net-works. For this goal, we came across the following question: for all vertex v of a vertex-colored digraph, how many colors (in maximum) a path starting in v can have? The answer for this question would help us to enumerate the colored rings since we would know how many colors a ring evolving some vertices could have, in maximum. Here, we call a path as v-super-colored if it starts in vertex v and it has the maximum amount of colors among all paths star
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Yu, Xiaofei Liao, Hai Jin, Bingsheng He, Haikun Liu, and Lin Gu. "DiGraph." In ASPLOS '19: Architectural Support for Programming Languages and Operating Systems. ACM, 2019. http://dx.doi.org/10.1145/3297858.3304029.

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

Sambinelli, Maycon, Cândida Nunes Da Silva, and Orlando Lee. "On Linial’s Conjecture for Split Digraphs." In I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9748.

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

Petrović, Vojislav, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Digraphs-Minisymposium." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2009: Volume 1 and Volume 2. AIP, 2009. http://dx.doi.org/10.1063/1.3241301.

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

Marshall, Linda, and Derrick Kourie. "Deriving a digraph isomorphism for digraph compliance measurement." In the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists. ACM Press, 2010. http://dx.doi.org/10.1145/1899503.1899521.

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

Reports on the topic "Digraphe"

1

Gao, Chunkai, Francesco Bullo, and Jorge Cortes. Notes on Averaging Over Acyclic Digraphs and Discrete Coverage Control. Defense Technical Information Center, 2006. http://dx.doi.org/10.21236/ada459077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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