Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Francesc Comellas, Margarida Mitjana |
Cycles in the cycle prefix digraph. |
Ars Comb. |
2001 |
DBLP BibTeX RDF |
|
16 | Toru Hasunuma |
Completely independent spanning trees in the underlying graph of a line digraph. |
Discret. Math. |
2001 |
DBLP DOI BibTeX RDF |
|
16 | S. Mehdi Hashemi |
Digraph embedding. |
Discret. Math. |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Stéphan Thomassé |
Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Steven B. Gillispie, Michael D. Perlman |
Enumerating Markov Equivalence Classes of Acyclic Digraph Models. |
UAI |
2001 |
DBLP BibTeX RDF |
|
16 | Christophe Haro, Patrick Martineau, Christian Proust |
Digraph representation by its path matrix The particular case of the bipartite graphs. |
Electron. Notes Discret. Math. |
2000 |
DBLP DOI BibTeX RDF |
|
16 | R. C. Mittal, Ahmad Al-Kurdi |
Solution of a sparse linear system by using digraph. |
Int. J. Comput. Math. |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Ottavio M. D'Antona, Emanuele Munarini |
The Cycle-Path Indicator Polynomial of a Digraph. |
Adv. Appl. Math. |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Maria Pia Fanti, Bruno Maione, Biagio Turchiano |
Comparing digraph and Petri net approaches to deadlock avoidance in FMS. |
IEEE Trans. Syst. Man Cybern. Part B |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Daniel Granot, Frieda Granot, Weiping R. Zhu |
Naturally submodular digraphs and forbidden digraph configurations. |
Discret. Appl. Math. |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam |
The m-step competition graph of a digraph. |
Discret. Appl. Math. |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Xudong Yuan, Mao-cheng Cai |
Vertices of degree k in a minimally k-edge-connected digraph. |
Discret. Math. |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Zhicheng Gao, Brendan D. McKay, Xiaoji Wang |
Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph. |
Random Struct. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Harold N. Gabow, Tibor Jordán |
Incrementing Bipartite Digraph Edge-Connectivity. |
J. Comb. Optim. |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Gregory Z. Gutin, Anders Yeo |
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Xudong Yuan, Liying Kang, Mao-cheng Cai |
The number of vertices of degree k in a minimally k-edge-connected digraph. |
J. Graph Theory |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Robin Thomas 0001 |
Digraph minors and algorithms (abstract only). |
SODA |
2000 |
DBLP BibTeX RDF |
|
16 | Margaret Mitchell |
Use of Series Parallel Digraph Analysis in Generating Instructions for Multiple Users. |
VIP |
2000 |
DBLP BibTeX RDF |
|
16 | Anders Yeo |
How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity? |
Graphs Comb. |
1999 |
DBLP DOI BibTeX RDF |
|
16 | G. S. Gursaran, S. Kanungo, A. K. Sinha |
Rule-base content verification using a digraph-based modelling approach. |
Artif. Intell. Eng. |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Jørgen Bang-Jensen, Yubao Guo, Anders Yeo |
A New Sufficient Condition for a Digraph to Be Hamiltonian. |
Discret. Appl. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
16 | András Frank |
Increasing the rooted-connectivity of a digraph by one. |
Math. Program. |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Victor Neumann-Lara |
The acyclic disconnection of a digraph. |
Discret. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Gary Chartrand, Frank Harary, Bill Quan Yue |
On the out-domination and in-domination numbers of a digraph. |
Discret. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Guofei Zhou, Kemin Zhang |
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. |
Australas. J Comb. |
1999 |
DBLP BibTeX RDF |
|
16 | Anders Yeo |
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Hortensia Galeana-Sánchez, Laura Pastrana Ramírez |
Kernels in edge coloured line digraph. |
Discuss. Math. Graph Theory |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Chris Jagger |
Extremal Digraph Results for Topological Complete Subgraphs. |
Eur. J. Comb. |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Kusnadi, Craig Beebe, Jo Dale Carothers |
Digraph visualization using a neural algorithm with a heuristic activation scheme. |
IEEE Trans. Syst. Man Cybern. Part B |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Michael A. Henning, Hiren Maharaj |
Some General Aspects of the Framing Number of a Digraph. |
Discret. Appl. Math. |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Guido Maione, Frank DiCesare |
A Petri net and digraph-theoretic approach for deadlock avoidance in flexible manufacturing systems. |
SMC |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Aviezri S. Fraenkel |
Combinatorial game theory foundations applied to digraph kernels. |
Electron. J. Comb. |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Toru Hasunuma, Yukio Shibata |
Containment of Butterflies in Networks Constructed by the Line Digraph Operation. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Ulrich Huckenbeck |
On Valve Adjustments that Interrupt all s-t-Paths in a Digraph. |
J. Autom. Lang. Comb. |
1997 |
DBLP DOI BibTeX RDF |
|
16 | David M. Evans 0001 |
An Infinite Highly Arc-transitive Digraph. |
Eur. J. Comb. |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Xin He, Zhi-Zhong Chen |
Shortest Path in Complete Bipartite Digraph Problem and its Applications. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Peng-Jun Wan, Allalaghatta Pavan |
A scalable TWDM lightwave network based on generalized de Bruijn digraph. |
Network Design: Connectivity and Facilities Location |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Suresh Viswanathan, Éva Czabarka, Abhijit Sengupta |
On Fault-Tolerant Embedding of Hamiltonian Circuits in Line Digraph Interconnection Networks. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Gregory Z. Gutin, Anders Yeo |
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. |
Discret. Appl. Math. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Terunao Soneoka, Makoto Imase, Yoshifumi Manabe |
Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II. |
Discret. Appl. Math. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Rudolf Müller |
On the partial order polytope of a digraph. |
Math. Program. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Krystyna T. Balinska, Louis V. Quintas |
Degrees in a digraph whose nodes are graphs. |
Discret. Math. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang 0007 |
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. |
Discret. Math. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Chong-Keang Lim, Kah Seng Lam |
The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem. |
Discret. Math. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Henry Jacob, Henry Meyniel |
About quasi-kernels in a digraph. |
Discret. Math. |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Jørgen Bang-Jensen, Gregory Z. Gutin, Hao Li |
Sufficient conditions for a digraph to be Hamiltonian. |
J. Graph Theory |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Chris Jagger |
An extremal function for digraph subcontraction. |
J. Graph Theory |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Ker-I Ko, Chih-Long Lin |
On the longest circuit in an alterable digraph. |
J. Glob. Optim. |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman |
The Reversing Number of a Digraph. |
Discret. Appl. Math. |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Fan R. K. Chung, Ronald L. Graham |
On the Cover Polynomial of a Digraph. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Samir Khuller, Balaji Raghavachari, Neal E. Young |
Approximating the Minimum Equivalent Digraph. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Samir Khuller, Uzi Vishkin |
On the Parallel Complexity of Digraph Reachability. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Joseph Cheriyan, John H. Reif |
Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. |
Comb. |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Jian Guan, James H. Graham |
Diagnostic Reasoning With Fault Propagation Digraph and Sequential Testing. |
IEEE Trans. Syst. Man Cybern. Syst. |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi |
Different capacities of a digraph. |
Graphs Comb. |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis |
How to Draw a Series-Parallel Digraph. |
Int. J. Comput. Geom. Appl. |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Gregory Z. Gutin |
Finding a Longest Path in a Complete Multipartite Digraph. |
SIAM J. Discret. Math. |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Alexander F. Sidorenko |
Boundedness of optimal matrices in extremal multigraph and digraph problems. |
Comb. |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Sandip Das 0001, Malay K. Sen |
An interval digraph in relation to its associated bipartite graph. |
Discret. Math. |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Wen-Huei Chen, Chuan Yi Tang, Hasan Ural |
Minimum-Cost Synchronizable Test Sequence Generation via the DuplexU Digraph. |
INFOCOM |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Adriano Pascoletti |
An Optimal Algorithm for the Period of a Strongly Connected Digraph. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
16 | John H. Reif, Paul G. Spirakis |
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. |
Algorithmica |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Jorge Luis Villar |
The Underlying Graph of a Line Digraph. |
Discret. Appl. Math. |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Joseph Cheriyan, John H. Reif |
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. |
SODA |
1992 |
DBLP BibTeX RDF |
|
16 | Arlene Fortunato Machado, Clovis Perin Filho |
A Generalization of the Maximal Closure of a Digraph. |
IFIP Congress (1) |
1992 |
DBLP BibTeX RDF |
|
16 | Hortensia Galeana-Sánchez, Laura Pastrana Ramírez, Hugo Alberto Rincón-Mejía |
Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph. |
SIAM J. Discret. Math. |
1991 |
DBLP DOI BibTeX RDF |
|
16 | Denise Amar, André Raspaud |
Covering the vertices of a digraph by cycles of prescribed length. |
Discret. Math. |
1991 |
DBLP DOI BibTeX RDF |
|
16 | Jane N. Hagstrom |
Computing rooted communication reliability in an almost acyclic digraph. |
Networks |
1991 |
DBLP DOI BibTeX RDF |
|
16 | Mirka Miller |
Digraph covering and its application to two optimization problems. |
Australas. J Comb. |
1991 |
DBLP BibTeX RDF |
|
16 | Valerie King |
A lower bound for the recognition of digraph properties. |
Comb. |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Sadaaki Miyamoto, Shinsuke Suga, Ko Oi |
Methods of digraph representation and cluster analysis for analyzing free association. |
IEEE Trans. Syst. Man Cybern. |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Terunao Soneoka, Hiroshi Nakada, Makoto Imase |
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. |
Discret. Appl. Math. |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Richard M. Karp |
The Transitive Closure of a Random Digraph. |
Random Struct. Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Shmuel Friedland |
Every 7-regular digraph contains an even cycle. |
J. Comb. Theory, Ser. B |
1989 |
DBLP DOI BibTeX RDF |
|
16 | Klaus Simon |
Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. |
WG |
1989 |
DBLP DOI BibTeX RDF |
|
16 | Maciej J. Ciesielski, Edwin Kinnen |
Digraph Relaxation for 2-Dimensional Placement of IC Blocks. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1987 |
DBLP DOI BibTeX RDF |
|
16 | Debra D. Scott |
The competition-common enemy graph of a digraph. |
Discret. Appl. Math. |
1987 |
DBLP DOI BibTeX RDF |
|
16 | Mikio Kano |
Ranking the vertices of an r-partite paired comparison digraph. |
Discret. Appl. Math. |
1987 |
DBLP DOI BibTeX RDF |
|
16 | Pierre Duchet |
A sufficient condition for a digraph to be kernel-perfect. |
J. Graph Theory |
1987 |
DBLP DOI BibTeX RDF |
|
16 | Paz Morillo, Miguel Angel Fiol, J. Guitart |
On the (d, D, D, s) - Digraph Problem. |
AAECC |
1987 |
DBLP DOI BibTeX RDF |
|
16 | Nathaniel Dean |
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? |
J. Graph Theory |
1986 |
DBLP DOI BibTeX RDF |
|
16 | Avinash Agrawal, Appajosyula Satyanarayana |
Network reliability analysis using 2-connected digraph reductions. |
Networks |
1985 |
DBLP DOI BibTeX RDF |
|
16 | Neculai Andrei |
Sparse systems: digraph approach of large-scale linear systems theory. |
|
1985 |
RDF |
|
16 | W. G. Brown, Miklós Simonovits |
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures. |
Discret. Math. |
1984 |
DBLP DOI BibTeX RDF |
|
16 | Hiroshi Maehara |
A digraph represented by a family of boxes or spheres. |
J. Graph Theory |
1984 |
DBLP DOI BibTeX RDF |
|
16 | Ján Plesník |
On the sum of all distances in a graph or digraph. |
J. Graph Theory |
1984 |
DBLP DOI BibTeX RDF |
|
16 | Masasumi Kokawa, Satoshi Miyazaki, Sadanori Shingai |
Fault location using digraph and inverse direction search with application. |
Autom. |
1983 |
DBLP DOI BibTeX RDF |
|
16 | C. C. Chen, P. Manalastas |
Every finite strongly connected digraph of stability 2 has a Hamiltonian path. |
Discret. Math. |
1983 |
DBLP DOI BibTeX RDF |
|
16 | Mikio Kano, Akio Sakamoto |
Ranking the vertices of a weighted digraph using the length of forward arcs. |
Networks |
1983 |
DBLP DOI BibTeX RDF |
|
16 | Miguel Angel Fiol, Ignacio Alegre, J. Luis A. Yebra |
Line Digraph Iterations and the (d,k) Problem for Directed Graphs |
ISCA |
1983 |
DBLP DOI BibTeX RDF |
|
16 | Maciej M. Syslo |
A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph. |
Inf. Process. Lett. |
1982 |
DBLP DOI BibTeX RDF |
|
16 | George Loizou, Peter Thanisch |
Enumerating the cycles of a digraph: A new preprocessing strategy. |
Inf. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
16 | Olivier Cogis |
On the Ferrers dimension of a digraph. |
Discret. Math. |
1982 |
DBLP DOI BibTeX RDF |
|
16 | Silvano Martello, Paolo Toth |
Finding a minimum equivalent graph of a digraph. |
Networks |
1982 |
DBLP DOI BibTeX RDF |
|
16 | Victor Neumann-Lara |
The dichromatic number of a digraph. |
J. Comb. Theory, Ser. B |
1982 |
DBLP DOI BibTeX RDF |
|
16 | S. Ramachandran |
On a new digraph reconstruction conjecture. |
J. Comb. Theory, Ser. B |
1981 |
DBLP DOI BibTeX RDF |
|
16 | Svatopluk Poljak, Vojtech Rödl |
On the arc-chromatic number of a digraph. |
J. Comb. Theory, Ser. B |
1981 |
DBLP DOI BibTeX RDF |
|
16 | András Frank |
How to make a digraph strongly connected. |
Comb. |
1981 |
DBLP DOI BibTeX RDF |
|
16 | Richard D. Ringeisen, Clark A. Shingledecker |
Combined stress and human performance: a weighted digraph model. |
Math. Soc. Sci. |
1981 |
DBLP DOI BibTeX RDF |
|
16 | Jean-Pierre Barthélemy |
About the shortest chain between two vertices in a quasi strongly connected digraph with a potential. |
Discret. Math. |
1981 |
DBLP DOI BibTeX RDF |
|