digraphs - Robuta Search

https://research.ibm.com/publications/path-partitions-and-packs-of-acyclic-digraphs Path partitions and packs of acyclic digraphs for Pacific Journal of Mathematics - IBM Research Path partitions and packs of acyclic digraphs for Pacific Journal of Mathematics by R. Aharoni et al. https://cdm.ucalgary.ca/article/view/76698 On identifying vertices of tournament digraphs | Contributions to Discrete Mathematics identifying vertices tournament digraphs contributions https://arxiv.org/abs/0912.4035 [0912.4035] Maltsev digraphs have a majority polymorphism Abstract page for arXiv paper 0912.4035: Maltsev digraphs have a majority polymorphism digraphs majority polymorphism https://dl.tufts.edu/concern/pdfs/vm40z387t PDF | Optimization over digraphs: Linear algorithms with linear convergence | ID: vm40z387t | Tufts... pdf optimization digraphs linear https://manpages.ubuntu.com/manpages/resolute/man7/groff_rfc1345.7.html Ubuntu Manpage: groff_rfc1345 - special character names from RFC 1345 and Vim digraphs special character names from RFC 1345 and Vim digraphs https://data.ub.uio.no/skosmos/humord/en/page/c62568 Digraphs (Linguistics) - HUME - UB-Data Concept Digraphs (Linguistics) in vocabulary Humord digraphs linguistics hume ub data https://padlet.com/cbcastner/language-word-study-workshop-ls-13-summarizing-consonant-dig-n682fasmm4eb Language Word Study Workshop LS 13 Summarizing Consonant Digraphs word study language workshop ls summarizing https://www.ideals.illinois.edu/items/45509 Extremal problems for labelling of graphs and distance in digraphs | IDEALS problems labelling https://scholars.cityu.edu.hk/en/publications/bipartite-consensus-of-linear-multi-agent-systems-over-signed-dig/ Bipartite consensus of linear multi-agent systems over signed digraphs: An output feedback control... https://pure.psu.edu/en/publications/distributed-nonconvex-constrained-optimization-over-time-varying-/ Distributed nonconvex constrained optimization over time-varying digraphs - Penn State constrained optimization over time distributed digraphs penn https://uwspace.uwaterloo.ca/items/f7d8c06e-84a5-4756-816d-625e2e867b42 Cycles and coloring in graphs and digraphs cycles coloring graphs https://udspace.udel.edu/items/b62c0fc9-35cd-4688-9c4f-e6a4a0d4bed7 Properties of some algebraically defined digraphs This thesis is concerned with the study of a family of digraphs defined by systems of polynomial equations over finite fields. We explore the connectivity and... properties defined digraphs https://www.iac.cnr.it/index.php/seeking-critical-nodes-digraphs Seeking critical nodes in digraphs | IAC seeking critical nodes digraphs iac https://gcc.opensuse.org/gcc-doxygen/classdiagnostics_1_1digraphs_1_1edge.html GCC Middle and Back End API Reference: diagnostics::digraphs::edge Class Reference back end api reference gcc middle https://kth.diva-portal.org/smash/record.jsf?pid=diva2:1691315 An application of neighbourhoods in digraphs to the classification of binary dynamics to the application neighbourhoods https://arxiv.org/abs/1511.00113 [1511.00113] Adjacency matrices of random digraphs: singularity and anti-concentration Abstract page for arXiv paper 1511.00113: Adjacency matrices of random digraphs: singularity and anti-concentration adjacency matrices https://gcc.opensuse.org/gcc-doxygen/classdiagnostics_1_1digraphs_1_1object.html GCC Middle and Back End API Reference: diagnostics::digraphs::object Class Reference back end api reference gcc middle https://research-repository.uwa.edu.au/en/publications/vertex-primitive-s-arc-transitive-digraphs-of-symplectic-groups/ Vertex-primitive s-arc-transitive digraphs of symplectic groups - the UWA Profiles and Research... https://academiccommons.columbia.edu/doi/10.7916/D8C82JCH Dynamic Data Structures for Series Parallel Digraphs | Academic Commons We consider the problem of dynamically maintaining general series parallel directed acyclic graphs (GSP dags), two-terminal series parallel directed acyclic... dynamic data for series structures parallel digraphs https://research.birmingham.ac.uk/en/publications/hamilton-cycles-in-sparse-robustly-expanding-digraphs/ Hamilton cycles in sparse robustly expanding digraphs - University of Birmingham university of hamilton cycles sparse robustly https://lists.w3.org/Archives/Public/www-style/2015Mar/0257.html Re: [css-text] text-transform:capitalize and Unicode digraphs from Patrick Dark on 2015-03-17... https://gcc.opensuse.org/gcc-doxygen/namespacecustom__sarif__properties_1_1digraphs.html GCC Middle and Back End API Reference: custom_sarif_properties::digraphs Namespace Reference back end api reference https://research.birmingham.ac.uk/en/publications/cycle-partitions-in-dense-regular-digraphs-and-oriented-graphs/projects/ Cycle Partitions in Dense Regular Digraphs and Oriented Graphs - Projects - University of Birmingham https://biblio.ugent.be/publication/8655821 Relational Galois connections between transitive fuzzy digraphs relational galois connections transitive fuzzy https://netnerds.wixsite.com/fonicsfun/digraphs-and-diphthongs Digraphs and Diphthongs | Fonicsfun digraphs diphthongs https://arxiv.org/abs/2306.16134 [2306.16134] New Menger-like dualities in digraphs and applications to half-integral linkages Abstract page for arXiv paper 2306.16134: New Menger-like dualities in digraphs and applications to half-integral linkages https://publications.rwth-aachen.de/record/62244 Maximally connected graphs and digraphs - RWTH Publications Die graphentheoretischen Parameter Kantenzusammenhangszahl bzw. Eckenzusammenhangszahl entsprechen der kleinsten Anzahl von Kanten bzw. Ecken, deren Entfernung... connected graphs rwth publications https://scholars.duke.edu/publication/1449561 Scholars@Duke publication: The circular law for random regular digraphs with random edge weights