Search results for "digraphs"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Gesualdo Scutari, Ying Sun 0003	Distributed nonconvex constrained optimization over time-varying digraphs.	Math. Program.	2019	DBLP DOI BibTeX RDF
12	Weige Xi, Ligong Wang 0001	On the signless Laplacian spectral radius of weighted digraphs.	Discret. Optim.	2019	DBLP DOI BibTeX RDF
12	Benoît Larose, Barnaby Martin, Daniël Paulusma	Surjective H-Colouring over Reflexive Digraphs.	ACM Trans. Comput. Theory	2019	DBLP DOI BibTeX RDF
12	Stephen W. Drury, Huiqiu Lin	Corrigendum to "Colorings and spectral radius of digraphs" [Discrete Math. 339 (1) (2016) 327-332].	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Zai Ping Lu, Er Jian Xu	On arc-transitive Cayley digraphs of out-valency 3.	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Rögnvaldur G. Möller, Primoz Potocnik, Norbert Seifter	Sharply k-arc-transitive-digraphs: Finite and infinite examples.	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng	Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Zejun Huang, Zhenhua Lyu, Pu Qiao	A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints.	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	James Tuite	Digraphs with degree two and excess two are diregular.	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Michal Walicki	Kernels of digraphs with finitely many ends.	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai	Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.	Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Asaf Ferber, Eoin Long	Packing and counting arbitrary Hamilton cycles in random digraphs.	Random Struct. Algorithms	2019	DBLP DOI BibTeX RDF
12	Frank Gurski, Dominique Komander, Carolin Rehs	Oriented Coloring on Recursively Defined Digraphs.	Algorithms	2019	DBLP DOI BibTeX RDF
12	Shuang Zhao, Jixiang Meng	Arc Fault Tolerance of Maximally Arc-Connected Networks Modeled By Digraphs.	Comput. J.	2019	DBLP DOI BibTeX RDF
12	Nicolas Lichiardopol, Carol T. Zamfirescu	On the size of maximally non-hamiltonian digraphs.	Ars Math. Contemp.	2019	DBLP DOI BibTeX RDF
12	Mariusz Grech, Wilfried Imrich, Anna Dorota Krystek, Lukasz Jan Wojakowski	Direct product of automorphism groups of digraphs.	Ars Math. Contemp.	2019	DBLP DOI BibTeX RDF
12	Zhenhua Deng, Xiaohong Nian	Distributed Generalized Nash Equilibrium Seeking Algorithm Design for Aggregative Games Over Weight-Balanced Digraphs.	IEEE Trans. Neural Networks Learn. Syst.	2019	DBLP DOI BibTeX RDF
12	Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou	On the k-domination number of digraphs.	J. Comb. Optim.	2019	DBLP DOI BibTeX RDF
12	Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou	Extremal digraphs for an upper bound on the Roman domination number.	J. Comb. Optim.	2019	DBLP DOI BibTeX RDF
12	Luke Morgan, Primoz Potocnik, Gabriel Verret	Arc-transitive digraphs of given out-valency and with blocks of given size.	J. Comb. Theory, Ser. B	2019	DBLP DOI BibTeX RDF
12	William Lochet	Immersion of transitive tournaments in digraphs with large minimum outdegree.	J. Comb. Theory, Ser. B	2019	DBLP DOI BibTeX RDF
12	Fedor V. Fomin, Michal Pilipczuk	On width measures and topological problems on semi-complete digraphs.	J. Comb. Theory, Ser. B	2019	DBLP DOI BibTeX RDF
12	Florian Barbero, Christophe Paul, Michal Pilipczuk	Strong immersion is a well-quasi-ordering for semicomplete digraphs.	J. Graph Theory	2019	DBLP DOI BibTeX RDF
12	Hortensia Galeana-Sánchez, César Hernández-Cruz	A dichotomy for the kernel by H-walks problem in digraphs.	J. Graph Theory	2019	DBLP DOI BibTeX RDF
12	Achilles A. Beros, Bjørn Kjos-Hanssen, Daylan Kaui Yogi	Planar Digraphs for Automatic Complexity.	TAMC	2019	DBLP DOI BibTeX RDF
12	Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich	Computing k-Modal Embeddings of Planar Digraphs.	ESA	2019	DBLP DOI BibTeX RDF
12	James Usevitch, Dimitra Panagou	Determining r-Robustness of Digraphs Using Mixed Integer Linear Programming.	ACC	2019	DBLP DOI BibTeX RDF
12	Nguyen T. Hung, Francisco F. C. Rego, António M. Pascoal	Event-Triggered Communications for the Synchronization of Nonlinear Multi Agent Systems on Weight-Balanced Digraphs.	ECC	2019	DBLP DOI BibTeX RDF
12	Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic	Directed Intersection Representations and the Information Content of Digraphs.	ISIT	2019	DBLP DOI BibTeX RDF
12	Chung Chan, Ali Al-Bashabsheh, Da Sun Handason Tam, Chao Zhao	Finding Better Web Communities in Digraphs via Max-Flow Min-Cut.	ISIT	2019	DBLP DOI BibTeX RDF
12	Claudio Altafini	Investigating stability of Laplacians on signed digraphs via eventual positivity.	CDC	2019	DBLP DOI BibTeX RDF
12	James Berneburg, Cameron Nowzari	Distributed Dynamic Event-Triggered Algorithms with Positive Minimum Inter-Event Times on Weight-Balanced Digraphs.	CDC	2019	DBLP DOI BibTeX RDF
12	Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi	A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.	MFCS	2019	DBLP DOI BibTeX RDF
12	Serge Gaspers, Ray Li	Enumeration of Preferred Extensions in Almost Oriented Digraphs.	MFCS	2019	DBLP DOI BibTeX RDF
12	Konrad Andrzej Markowski	Digraphs Structures with Weights Corresponding to One-Dimensional Fractional Systems.	AUTOMATION	2019	DBLP DOI BibTeX RDF
12	Yogesh Chinnappa, Daniela Constantinescu	Average Consensus in Matrix-Weight-Balanced Digraphs.	CASE	2019	DBLP DOI BibTeX RDF
12	Themistoklis Charalambous, Nikolaos E. Manitara, Christoforos N. Hadjicostis	Privacy-Preserving Average Consensus over Digraphs in the Presence of Time Delays.	Allerton	2019	DBLP DOI BibTeX RDF
12	Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich 0001, Sebastian Siebertz	Algorithmic Properties of Sparse Digraphs.	STACS	2019	DBLP DOI BibTeX RDF
12	Anssi Yli-Jyrä	Transition-Based Coding and Formal Language Theory for Ordered Digraphs.	FSMNLP	2019	DBLP BibTeX RDF
12	Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco, Manuel Ojeda-Aciego	Towards fuzzy relational Galois connections between fuzzy T-digraphs.	EUSFLAT Conf.	2019	DBLP DOI BibTeX RDF
12	Frank Gurski, Carolin Rehs	Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs.	SOFSEM	2019	DBLP DOI BibTeX RDF
12	Wei Ding 0006, Ke Qiu 0001	Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs.	AAIM	2019	DBLP DOI BibTeX RDF
12	Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza	Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.	IPEC	2019	DBLP DOI BibTeX RDF
12	Jocelyn Thiebaut	Algorithmic and structural results on directed cycles in dense digraphs. (Résultats algorithmiques et structurels sur les cycles orientés dans les digraphes denses).		2019	RDF
12	Fabian Gärtner	Comparative Genomics in Distant Taxa: Generating Total Orders of Digraphs		2019	RDF
12	Pietro Codara, Ottavio M. D'Antona	Dyck-Eulerian digraphs.	Electron. Notes Discret. Math.	2018	DBLP DOI BibTeX RDF
12	Fiachra Knox, Robert Sámal	Linear Bound for Majority Colourings of Digraphs.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
12	Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel	The Diachromatic Number of Digraphs.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
12	Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé	Domination and Fractional Domination in Digraphs.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
12	Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes 0001	Bispindles in Strongly Connected Digraphs with Large Chromatic Number.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
12	Allan Lo, Viresh Patel	Hamilton Cycles in Sparse Robustly Expanding Digraphs.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
12	Muhammad Akram 0001, Shumaiza, Maham Arshad	A new approach based on fuzzy rough digraphs for decision-making.	J. Intell. Fuzzy Syst.	2018	DBLP DOI BibTeX RDF
12	Zhiren Sun, Sizhong Zhou	A generalization of orthogonal factorizations in digraphs.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
12	Shangwei Lin 0002, Ya'nan Jin, Chunfang Li	Cartesian product digraphs with optimal restricted arc connectivity.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
12	Tingting Han, Ruijuan Li	Arc-disjont Hamiltonian cycles in round decomposable locally semicomplete digraphs.	Discuss. Math. Graph Theory	2018	DBLP DOI BibTeX RDF
12	Zyta Dziechcinska-Halamoda, Joanna Górska, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien	Extremal irregular digraphs.	Discuss. Math. Graph Theory	2018	DBLP DOI BibTeX RDF
12	Lovkush Agarwal, Michael Kompatscher	${2^{{\aleph _0}}}$ Pairwise nonisomorphic Maximal-closed Subgroups of Sym(ℕ) via the Classification of the Reducts of the Henson digraphs.	J. Symb. Log.	2018	DBLP DOI BibTeX RDF
12	Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak	On locally irregular decompositions and the 1-2 Conjecture in digraphs.	Discret. Math. Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
12	Hortensia Galeana-Sánchez, Mika Olsen	Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments.	Discret. Math. Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
12	Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu	Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem.	ACM Trans. Algorithms	2018	DBLP DOI BibTeX RDF
12	Florian Barbero, Christophe Paul, Michal Pilipczuk	Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs.	ACM Trans. Algorithms	2018	DBLP DOI BibTeX RDF
12	Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu	Connectivity of half vertex transitive digraphs.	Appl. Math. Comput.	2018	DBLP DOI BibTeX RDF
12	Changchang Dong, Juan Liu 0001, Xindong Zhang	Supereulerian digraphs with given diameter.	Appl. Math. Comput.	2018	DBLP DOI BibTeX RDF
12	Xiuwen Yang, Ligong Wang 0001	On the ordering of bicyclic digraphs with respect to energy and iota energy.	Appl. Math. Comput.	2018	DBLP DOI BibTeX RDF
12	Sidra Sayed, Nabeela Ishfaq, Muhammad Akram 0001, Florentin Smarandache	Rough Neutrosophic Digraphs with Application.	Axioms	2018	DBLP DOI BibTeX RDF
12	Shuya Chiba, Tomoki Yamashita	On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
12	Benoît Larose, Mark H. Siggers	NU Polymorphisms on Reflexive Digraphs.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
12	Lucas Boczkowski, Yuval Peres, Perla Sousi	Sensitivity of Mixing Times in Eulerian Digraphs.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
12	Pei Xie, Keyou You, Roberto Tempo, Shiji Song, Cheng Wu	Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs.	IEEE Trans. Autom. Control.	2018	DBLP DOI BibTeX RDF
12	João Araújo 0002, Wolfram Bentz, Edward Dobson, Janusz Konieczny, Joy Morris	Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory.	Comb.	2018	DBLP DOI BibTeX RDF
12	Zhenhua Deng, Shu Liang, Yiguang Hong	Distributed Continuous-Time Algorithms for Resource Allocation Problems Over Weight-Balanced Digraphs.	IEEE Trans. Cybern.	2018	DBLP DOI BibTeX RDF
12	Donglei Yang, Yandong Bai, Guanghui Wang 0002, Jianliang Wu	On splitting digraphs.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
12	Jørgen Bang-Jensen, Tilde My Christiansen	Degree constrained 2-partitions of semicomplete digraphs.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
12	Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo	Out-degree reducing partitions of digraphs.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
12	Catherine S. Greenhill, Matteo Sfragara	The switch Markov chain for sampling irregular graphs and digraphs.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
12	Huabin Cao, Bicheng Zhang, Zhiheng Zhou	One-to-one disjoint path covers in digraphs.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
12	Akanksha Agrawal 0001, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi	Kernels for deletion to classes of acyclic digraphs.	J. Comput. Syst. Sci.	2018	DBLP DOI BibTeX RDF
12	Gregory Z. Gutin, Felix Reidl, Magnus Wahlström	k-distinct in- and out-branchings in digraphs.	J. Comput. Syst. Sci.	2018	DBLP DOI BibTeX RDF
12	Adi Botea, Davide Bonusi, Pavel Surynek	Solving Multi-agent Path Finding on Strongly Biconnected Digraphs.	J. Artif. Intell. Res.	2018	DBLP DOI BibTeX RDF
12	Janet Anderson, Hong-Jian Lai, Xiaomin Li, Xiaoxia Lin, Murong Xu	Minimax properties of some density measures in graphs and digraphs.	Int. J. Comput. Math. Comput. Syst. Theory	2018	DBLP DOI BibTeX RDF
12	Sayan Panma, Nuttawoot Nupo	On the Independence Number of Cayley Digraphs of Rectangular Groups.	Graphs Comb.	2018	DBLP DOI BibTeX RDF
12	Janusz Adamus	A Meyniel-Type Condition for Bipancyclicity in Balanced Bipartite Digraphs.	Graphs Comb.	2018	DBLP DOI BibTeX RDF
12	Chang-Shen Lee, Nicolò Michelusi, Gesualdo Scutari	Limited Rate Distributed Weight-Balancing and Average Consensus Over Digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Amir Daneshmand, Ying Sun 0003, Gesualdo Scutari, Francisco Facchinei, Brian M. Sadler	Decentralized Dictionary Learning Over Time-Varying Digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Frank Gurski, Carolin Rehs	Computing directed path-width and directed tree-width of recursively defined digraphs.	CoRR	2018	DBLP BibTeX RDF
12	G. S. Fridman	On critical and maximal digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa	The b-branching problem in digraphs.	CoRR	2018	DBLP BibTeX RDF
12	David Gómez-Gutiérrez, Carlos Renato Vázquez, Sergej Celikovský, Juan Diego Sánchez-Torres, Javier Ruiz-León	On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Jiaqi Zhang 0001, Keyou You	AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Pavol Hell, Jing Huang 0007, Ross M. McConnell, Arash Rafiey	Interval-Like Graphs and Digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Gesualdo Scutari, Ying Sun 0003	Distributed Nonconvex Constrained Optimization over Time-Varying Digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai	Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Sergey Parsegov, Pavel Chebotarev	Second-Order Agents on Ring Digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Asahi Takaoka	A recognition algorithm for adjusted interval digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Ranveer Singh, Swarup Kumar Panda, Naomi Shaked-Monderer, Abraham Berman	Rank of weighted digraphs with blocks.	CoRR	2018	DBLP BibTeX RDF
12	James Usevitch, Dimitra Panagou	Determining r-Robustness of Arbitrary Digraphs Using Zero-One Linear Integer Programming.	CoRR	2018	DBLP BibTeX RDF
12	Yuefang Sun, Gregory Z. Gutin	Strong Subgraph Connectivity of Digraphs: A Survey.	CoRR	2018	DBLP BibTeX RDF
12	Frank Gurski, Carolin Rehs, Jochen Rethmann	Characterizations and Directed Path-Width of Sequence Digraphs.	CoRR	2018	DBLP BibTeX RDF
12	Guillaume Bagan, Alice Joffard, Hamamache Kheddouci	Eternal dominating sets on digraphs and orientations of graphs.	CoRR	2018	DBLP BibTeX RDF
12	Kai Siong Yow, Kerri Morgan, Graham Farr	Factorisation of Greedoid Polynomials of Rooted Digraphs.	CoRR	2018	DBLP DOI BibTeX RDF