Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Mihails Milehins |
Category Theory for ZFC in HOL I: Foundations: Design Patterns, Set Theory, Digraphs, Semicategories. |
Arch. Formal Proofs |
2021 |
DBLP BibTeX RDF |
|
12 | Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro |
H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. |
Contributions Discret. Math. |
2021 |
DBLP BibTeX RDF |
|
12 | Katherina Böhmova, Cristina Dalfó, Clemens Huemer |
New cyclic Kautz digraphs with optimal diameter. |
Contributions Discret. Math. |
2021 |
DBLP BibTeX RDF |
|
12 | Yanan Zhu, Wenwu Yu, Wei Ren 0001, Guanghui Wen, Juping Gu |
Generalized Nash Equilibrium Seeking via Continuous-Time Coordination Dynamics Over Digraphs. |
IEEE Trans. Control. Netw. Syst. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Lei Shi 0012, Yuhua Cheng 0001, Jinliang Shao, Xilin Zhang |
Collective Behavior of Multileader Multiagent Systems With Random Interactions Over Signed Digraphs. |
IEEE Trans. Control. Netw. Syst. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Chong-Xiao Shi, Guang-Hong Yang |
Distributed Optimization Under Unbalanced Digraphs With Node Errors: Robustness of Surplus-Based Dual Averaging Algorithm. |
IEEE Trans. Control. Netw. Syst. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Pietro Caputo, Matteo Quattropani |
Mixing time of PageRank surfers on sparse random digraphs. |
Random Struct. Algorithms |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Selim Bahadir, Elvan Ceyhan |
On the Number of Weakly Connected Subdigraphs in Random kNN Digraphs. |
Discret. Comput. Geom. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Esmaeil Parsa, P. Mark Kayll |
On random digraphs and cores. |
Australas. J Comb. |
2021 |
DBLP BibTeX RDF |
|
12 | S. Ganesamurthy, R. S. Manikandan, P. Paulraja |
Decompositions of some classes of regular graphs and digraphs into cycles of length 4p. |
Australas. J Comb. |
2021 |
DBLP BibTeX RDF |
|
12 | Sho Kubota, Etsuo Segawa, Tetsuji Taniguchi |
Quantum walks defined by digraphs and generalized Hermitian adjacency matrices. |
Quantum Inf. Process. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zhenhua Lyu |
Digraphs that contain at most t distinct walks of a given length with the same endpoints. |
J. Comb. Optim. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yingbin Ma, Kairui Nie |
(Strong) Total proper connection of some digraphs. |
J. Comb. Optim. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Alan M. Frieze, Wesley Pegden |
Maker Breaker on digraphs. |
J. Graph Theory |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jesús Alva-Samos, César Hernández-Cruz |
k-quasi-transitive digraphs of large diameter. |
J. Graph Theory |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Guanwu Liu, Xingxing Yu |
Partitioning digraphs with outdegree at least 4. |
J. Graph Theory |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mathew C. Francis, Pavol Hell, Dalu Jacob |
On the Kernel and Related Problems in Interval Digraphs. |
ISAAC |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Shiri Chechik, Tianyi Zhang 0008 |
Incremental Single Source Shortest Paths in Sparse Digraphs. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shalet Thottungal Joseph |
Lexicographic Product of Digraphs and Related Boundary-Type Sets. |
CALDAM |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Abhinav Nellore, Austin Nguyen, Reid F. Thompson |
An Invertible Transform for Efficient String Matching in Labeled Digraphs. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. |
ICALP |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Muhammad Umar Javed, Jorge I. Poveda, Xudong Chen 0002 |
Excitation Conditions for Uniform ExponentiaGBl Stability of the Cooperative Gradient Algorithm over Weakly Connected Digraphs. |
ACC |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Wei Jiang 0014, Themistoklis Charalambous |
Distributed Alternating Direction Method of Multipliers using Finite-Time Exact Ratio Consensus in Digraphs. |
ECC |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Wei Jiang 0014, Andreas Grammenos, Evangelia Kalyvianaki, Themistoklis Charalambous |
An Asynchronous Approximate Distributed Alternating Direction Method of Multipliers in Digraphs. |
CDC |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zeev Nutov |
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. |
CSR |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht |
Directed Width Parameters on Semicomplete Digraphs. |
COCOA |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Frank Gurski, Dominique Komander, Marvin Lindemann |
Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs. |
OR |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz |
Hajós and Ore Constructions for Digraphs. |
Electron. J. Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Louigi Addario-Berry, Borja Balle, Guillem Perarnau |
Diameter and Stationary Distribution of Random $r$-Out Digraphs. |
Electron. J. Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Miroslav Olsák |
Loop conditions for strongly connected digraphs. |
Int. J. Algebra Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Han Xiao 0003 |
On ideal semicomplete digraphs. |
Inf. Process. Lett. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Martin Sonntag, Hanns-Martin Teichert |
Niche hypergraphs of products of digraphs. |
Discuss. Math. Graph Theory |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Nadia El Amri |
(≤ k)-hereditarily Reconstructible Digraphs. |
J. Multiple Valued Log. Soft Comput. |
2020 |
DBLP BibTeX RDF |
|
12 | Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco, Manuel Ojeda-Aciego, Bernard De Baets |
Relational Galois connections between transitive digraphs: Characterization and construction. |
Inf. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona |
Identifying codes in line digraphs. |
Appl. Math. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Changchang Dong, Juan Liu 0001, Jixiang Meng |
Supereulerian 3-path-quasi-transitive digraphs. |
Appl. Math. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Xinli Shi, Jinde Cao, Guanghui Wen, Xinghuo Yu 0001 |
Finite-Time Stability for Network Systems With Nonlinear Protocols Over Signed Digraphs. |
IEEE Trans. Netw. Sci. Eng. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Taihua Xu, Guoyin Wang 0001, Jie Yang 0052 |
Finding strongly connected components of simple digraphs based on granulation strategy. |
Int. J. Approx. Reason. |
2020 |
DBLP DOI 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. |
Int. J. Control |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Satoshi Kawamura, Kai Cai, Mengbin Ye, Zhiyun Lin |
Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs. |
Int. J. Control |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Pavol Hell, Jing Huang 0007, Ross M. McConnell, Arash Rafiey |
Min-Orderable Digraphs. |
SIAM J. Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yichao Ao, Yingmin Jia |
Robust H2/H∞ group consensus control for linear clusters over signed digraphs. |
J. Frankl. Inst. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani |
1-bend upward planar slope number of SP-digraphs. |
Comput. Geom. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Xinli Shi, Jinde Cao, Xinghuo Yu 0001, Guanghui Wen |
Finite-Time Stability of Network Systems With Discontinuous Dynamics Over Signed Digraphs. |
IEEE Trans. Autom. Control. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Seyyed Shaho Alaviani, Nicola Elia |
Distributed Multiagent Convex Optimization Over Random Digraphs. |
IEEE Trans. Autom. Control. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Xudong Chen 0002, Zuguang Gao, Tamer Basar |
Asymptotic Behavior of Conjunctive Boolean Networks Over Weakly Connected Digraphs. |
IEEE Trans. Autom. Control. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jiaqi Zhang 0001, Keyou You |
AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs. |
IEEE Trans. Autom. Control. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Paul D. Seymour, Sophie Spirkl |
Short Directed Cycles in Bipartite Digraphs. |
Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yufei Zhao, Yunkun Zhou |
Impartial Digraphs. |
Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | James Usevitch, Dimitra Panagou |
Determining r- and (r, s)-robustness of digraphs using mixed integer linear programming. |
Autom. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman |
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Paul Ellis, Attila Joó, Dániel T. Soukup |
Reducing the dichromatic number via cycle reversions in infinite digraphs. |
Eur. J. Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Marcel Abas, Tomás Vetrík |
Metric dimension of Cayley digraphs of split metacyclic groups. |
Theor. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Artür Manukyan, Elvan Ceyhan |
Classification using proximity catch digraphs. |
Mach. Learn. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Luke Morgan, Joy Morris, Gabriel Verret |
Digraphs with small automorphism groups that are Cayley on two nonisomorphic groups. |
Art Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Dong Liang, Jie Huang 0001 |
Leader-following bipartite consensus of multiple uncertain Euler-Lagrange systems over signed switching digraphs. |
Neurocomputing |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Laura Pastrana-Ramírez, Rocío Sánchez-López, Miguel Tecpa-Galván |
Semicomplete absorbent sets in digraphs. |
AKCE Int. J. Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López |
Extensions of Richardson's theorem for infinite digraphs and (ℬ)-kernels. |
AKCE Int. J. Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Simon Joyce, Alex Schaefer, Douglas B. West, Thomas Zaslavsky |
Strongly connectable digraphs and non-transitive dice. |
AKCE Int. J. Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Hortensia Galeana-Sánchez, Miguel Tecpa-Galván |
-panchromatic digraphs. |
AKCE Int. J. Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | S. Arumugam 0001, Jay S. Bagga |
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs. |
AKCE Int. J. Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Pilar Cano, Hortensia Galeana-Sánchez, Ilan A. Goldfeder |
Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs. |
AKCE Int. J. Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Alexandr V. Kostochka, Michael Stiebitz |
The Minimum Number of Edges in 4-Critical Digraphs of Given Order. |
Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Hortensia Galeana-Sánchez, Rocío Sánchez-López |
Richardson's theorem in quasi-transitive and pre-transitive digraphs. |
Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Pepijn Wissing, Edwin R. van Dam |
The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum. |
J. Comb. Theory, Ser. A |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Ximing Chen, Masaki Ogura 0001, Victor M. Preciado |
Bounds on the Spectral Radius of Digraphs from Subgraph Counts. |
SIAM J. Matrix Anal. Appl. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Camille Noûs, Kévin Perrot, Sylvain Sené, Lucas Venturini |
#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Jeff Kinne, Ashwin Murali, Arash Rafiey |
Digraphs Homomorphism Problems with Maltsev Condition. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Maximilian Probst Gutenberg |
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Mikko Koivisto, Antti Röyskö |
Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Zeev Nutov |
On rooted k-connectivity problems in quasi-bipartite digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Kenjiro Takazawa |
Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Ly Dinh, Rezvaneh Rezapour, Lan Jiang, Jana Diesner |
Structural balance in signed digraphs: considering transitivity to measure balance in graphs constructed by using different link signing methods. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Anita Liebenau, Nick Wormald |
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski |
Efficient Labeling for Reachability in Digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Florent Foucaud, Benjamin Gras 0002, Anthony Perez 0001, Florian Sikora |
On the complexity of Broadcast Domination and Multipacking in digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Kijung Kim |
The Italian domination numbers of some products of digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Frank Gurski, Dominique Komander, Marvin Lindemann |
Efficient computation of the oriented chromatic number of recursively defined digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Kijung Kim |
The Italian bondage and reinforcement numbers of digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Lukasz Kowalik, Konrad Majewski |
The Asymmetric Travelling Salesman Problem in Sparse Digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Pierre Aboulker, Pierre Charbit, Reza Naserasr |
Extension of Gyarfas-Sumner conjecture to digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Frank Gurski, Dominique Komander, Carolin Rehs |
Acyclic coloring of special digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Catherine Ordun, Sanjay Purushotham, Edward Raff |
Exploratory Analysis of Covid-19 Tweets using Topic Modeling, UMAP, and DiGraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Élie de Panafieu, Sergey Dovgal |
Counting directed acyclic and elementary digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | |
Karp's patching algorithm on dense digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Mohamed-Ali Belabbas, Xudong Chen 0002 |
On Integer Balancing of Digraphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau |
Domination and location in twin-free digraphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa |
The b-branching problem in digraphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Mariusz Grech, Andrzej Kisielewicz 0001 |
Synchronizing sequences for road colored digraphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Julien Bensmail, Kasper Szabo Lyngsie |
1-2-3 Conjecture in digraphs: More results and directions. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Kosuke Nakamura, Toru Araki |
Partitioning vertices into in- and out-dominating sets in digraphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Raphael Steiner |
A note on coloring digraphs of large girth. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Hamidi, Reza Ameri |
α-Derivable digraphs and its application in wireless sensor networking. |
Discret. Math. Algorithms Appl. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Weige Xi, Ligong Wang 0001 |
The Aα spectral radius and maximum outdegree of irregular digraphs. |
Discret. Optim. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros |
Vertex-monochromatic connectivity of strong digraphs. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Dean Crnkovic, Hadi Kharaghani, Andrea Svob |
Divisible design Cayley digraphs. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Kassie Archer, Ira M. Gessel, Christina Graves, Xuming Liang |
Counting acyclic and strong digraphs by descents. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Zejun Huang, Zhenhua Lyu |
Extremal digraphs avoiding an orientation of C4. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|