Search results for "digraphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Yosuke Kikuchi, Yukio Shibata	On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs.	COCOON	2001	DBLP DOI BibTeX RDF
81	Hristo N. Djidjev	On-Line Algorithms for Shortest Path Problems on Planar Digraphs.	WG	1996	DBLP DOI BibTeX RDF
69	Arvind Gupta, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey	Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.	COCOA	2008	DBLP DOI BibTeX RDF
69	Toru Hasunuma	Laying Out Iterated Line Digraphs Using Queues.	GD	2003	DBLP DOI BibTeX RDF
69	Peter Mahlmann, Christian Schindelhauer	Distributed random digraph transformations for peer-to-peer networks.	SPAA	2006	DBLP DOI BibTeX RDF	distributed algorithms, peer-to-peer networks, random graphs, expander graphs
59	Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege	07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs	2007	DBLP BibTeX RDF
59	Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege	07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs	2007	DBLP BibTeX RDF
58	Irith Ben-Arroyo Hartman	On Path Partitions and Colourings in Digraphs.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF
58	Terence Sim, Rajkumar Janakiraman	Are Digraphs Good for Free-Text Keystroke Dynamics?	CVPR	2007	DBLP DOI BibTeX RDF
58	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath	Book Embeddability of Series-Parallel Digraphs.	Algorithmica	2006	DBLP DOI BibTeX RDF	Book embeddability, Point set embedding
58	Michael Sampels	On Generalized Moore Digraphs.	PPAM	2003	DBLP DOI BibTeX RDF
58	Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic	Highly Arc-Transitive Digraphs With No Homomorphism Onto Z.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C25, 05C20
58	Giuseppe Di Battista, Roberto Tamassia	Upward Drawings of Acyclic Digraphs.	WG	1987	DBLP DOI BibTeX RDF
57	Xingde Jia	Wide Diameter of Cayley Digraphs of Finite Cyclic Groups.	ISPAN	2008	DBLP DOI BibTeX RDF	Cayley digraphs, communication networks, wide diameter, geometric representation
57	Wei Meng, Shengjia Li	Semicomplete Multipartite Digraphs Whose Every Arc Is Contained in a Hamiltonian Path.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	Semicomplete multipartite digraph, Semi-partition complete digraphs, Hamiltonian paths
57	Aviezri S. Fraenkel, Ofer Rahat	Infinite Cyclic Impartial Games.	Computers and Games	1998	DBLP DOI BibTeX RDF	infinite cyclic games, locally path-bounded digraphs, generalized Sprague-Grundy function
56	Nathalie Homobono, Claudine Peyrat	Connectivity of Imase and Itoh Digraphs.	IEEE Trans. Computers	1988	DBLP DOI BibTeX RDF	Itoh digraphs, interconnection networks, fault tolerant computing, multiprocessor interconnection networks, directed graphs, digraphs
47	Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege (eds.)	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs	2007	DBLP BibTeX RDF
47	Daniel Raible 0001, Henning Fernau	Exact Elimination of Cycles in Graphs.	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs	2007	DBLP BibTeX RDF
47	Igor Razgon, Barry O'Sullivan	Directed Feedback Vertex Set is Fixed-Parameter Tractable.	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs	2007	DBLP BibTeX RDF
47	Iris van Rooij, Matthew Hamilton, Moritz Müller, Todd Wareham	Approximating Solution Structure.	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs	2007	DBLP BibTeX RDF
47	Jianer Chen, Yang Liu 0002, Songjian Lu	Directed Feedback Vertex Set Problem is FPT.	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs	2007	DBLP BibTeX RDF
46	Deqiang Chen, Jie Zheng, Xiaoqian Wu	Computer Simulation and Word-Updating Dynamical Systems (WDS) on Digraphs.	ICIC (2)	2008	DBLP DOI BibTeX RDF	Word-updating Dynamical System (WDS), S-pseud Independent Set, Functional Digraph
46	Domingo Gómez-Pérez, Jaime Gutierrez 0001, Álvar Ibeas	Circulant Digraphs and Monomial Ideals.	CASC	2005	DBLP DOI BibTeX RDF
46	Rinovia Simanjuntak, Mirka Miller	Maximum Order of Planar Digraphs.	IJCCGGT	2003	DBLP DOI BibTeX RDF
46	Yosuke Kikuchi, Shingo Osawa, Yukio Shibata	Broadcasting in Generalized de Bruijn Digraphs.	COCOON	2002	DBLP DOI BibTeX RDF	generalized de Bruijn digraph, Imase Itoh digraph, k-ramified tree, broadcasting, Kronecker product
46	Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille	Recognizing Bipartite Incident-Graphs of Circulant Digraphs.	WG	1999	DBLP DOI BibTeX RDF	broadcasting, gossiping, graph isomorphism, circulant graphs, chordal rings
46	Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	On the Directed Degree-Preserving Spanning Tree Problem.	IWPEC	2009	DBLP DOI BibTeX RDF
46	Sergey Kitaev, Steve Seif	Word Problem of the Perkins Semigroup via Directed Acyclic Graphs.	Order	2008	DBLP DOI BibTeX RDF	Perkins semigroup, Free semigroup, Computational complexity -, Directed acyclic graph, Poset, Partially order set, Word problem
46	Paul Hunter, Stephan Kreutzer	Digraph measures: Kelly decompositions, games, and orderings.	SODA	2007	DBLP BibTeX RDF
46	Guillaume Fertin, André Raspaud	Families of Graphs Having Broadcasting and Gossiping Properties.	WG	1998	DBLP DOI BibTeX RDF	minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs
46	Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis	How to Draw a Series-Parallel Digraph (Extended Abstract).	SWAT	1992	DBLP DOI BibTeX RDF
46	Henk Meijer, R. Dawes	Fault Tolerant Networks of Specified Diameter.	WG	1988	DBLP DOI BibTeX RDF
35	Francesco Giordano, Giuseppe Liotta, Sue Whitesides	Embeddability Problems for Upward Planar Digraphs.	GD	2008	DBLP DOI BibTeX RDF
35	Jiangyan Guo, Elkin Vumar	The Vertex-Neighbor-Integrity of Digraphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	Vertex-neighbor-integrity, directed vertex-neighbor-integrity, orientation
35	Pascale Kuntz, Bruno Pinaud, Rémi Lehn	Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Hierarchical digraph, Genetic algorithm, Metaheuristics, Graph drawing
35	Efstratios Kontopoulos, Nick Bassiliades	Graphical Representation of Defeasible Logic Rules Using Digraphs.	SETN	2006	DBLP DOI BibTeX RDF
35	Yus Mochamad Cholily, Edy Tri Baskoro, Saladin Uttunggadewa	Some Conditions for the Existence of ( d, k)-Digraphs.	IJCCGGT	2003	DBLP DOI BibTeX RDF
35	Wenjun Xiao, Behrooz Parhami	Some Conclusions on Cayley Digraphs and Their Applications to Interconnection Networks.	GCC (2)	2003	DBLP DOI BibTeX RDF
35	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath	Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs.	GD	2002	DBLP DOI BibTeX RDF
35	Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela	Induced Broadcasting Algorithms in Iterated Line Digraphs.	Euro-Par, Vol. I	1996	DBLP DOI BibTeX RDF
35	Manfred Schnitzler	Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs.	WG	1980	DBLP DOI BibTeX RDF
35	Kenjiro Takazawa	A weighted even factor algorithm.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C27, 05C70
35	Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001	Parameterized Algorithms for Directed Maximum Leaf Problems.	ICALP	2007	DBLP DOI BibTeX RDF
35	Anna Agusti-Torra, Cristina Cervello-Pastor, Miguel Angel Fiol	A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks.	BROADNETS	2006	DBLP DOI BibTeX RDF
35	Mohammad Ali Safari	D-Width: A More Natural Measure for Directed Tree Width.	MFCS	2005	DBLP DOI BibTeX RDF
35	Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo	Quasi-Upward Planarity.	Algorithmica	2002	DBLP DOI BibTeX RDF	Upward, Flow techniques, Branch and bound, Planarity
35	Bruce L. Bauslaugh	List-Compactness of Infinite Directed Graphs.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
35	Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu	Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing.	WG	1991	DBLP DOI BibTeX RDF	line digraph iteration, diameter vulnerability, k-diameter, fault tolerance, graph, connectivity, container, de Bruijn graph, spread, Kautz graph
35	Ewald Speckenmeyer	On Feedback Problems in Diagraphs.	WG	1989	DBLP DOI BibTeX RDF
35	Sukhamay Kundu	An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.	ACM Southeast Regional Conference	1982	DBLP DOI BibTeX RDF	planar digraph, transitive reduction, algorithm, depth-first search
34	Deke Guo, Jie Wu 0001, Yunhao Liu 0001, Hai Jin 0001, Hanhua Chen, Tao Chen 0013	Quasi-Kautz Digraphs for Peer-to-Peer Networks.	IEEE Trans. Parallel Distributed Syst.	2011	DBLP DOI BibTeX RDF	Constant degree networks, Kautz digraphs, peer-to-peer networks
34	Noel Henry Patson	Visualizing Global Patterns in Huge Digraphs.	NSS	2009	DBLP DOI BibTeX RDF	visualization, digraphs
34	Azman Samsudin, Kyungsook Y. Lee	nD-dBPN: New Self-Routing Permutation Networks Based On the de Bruijn Digraphs.	ICPP	1998	DBLP DOI BibTeX RDF	Non-blocking Networks, de Bruijn Digraphs and Banyan Networks, Permutation Networks
34	Hannah Honghua Yang, D. F. Wong 0001	New algorithms for min-cut replication in partitioned circuits.	ICCAD	1995	DBLP DOI BibTeX RDF	Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout
23	Dean Crnkovic, Andrea Svob	Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs.	Graphs Comb.	2024	DBLP DOI BibTeX RDF
23	Junran Yu	Directed Tree Connectivity of Symmetric Digraphs and Complete Bipartite Digraphs.	J. Interconnect. Networks	2023	DBLP DOI BibTeX RDF
23	Ahmad Abdi, Gérard Cornuéjols, Michael Zlatin	On Packing Dijoins in Digraphs and Weighted Digraphs.	SIAM J. Discret. Math.	2023	DBLP DOI BibTeX RDF
23	Yaoyao Zhang, Jixiang Meng	On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs.	Discuss. Math. Graph Theory	2022	DBLP DOI BibTeX RDF
23	Zhengyu Guo, Dongdong Jia, Gengsheng Zhang	Minimum arc-cuts of normally regular digraphs and Deza digraphs.	Discret. Math.	2022	DBLP DOI BibTeX RDF
23	Louis DeBiasio, András Gyárfás	Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
23	Ruixia Wang, Linxin Wu, Wei Meng	Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs.	Discret. Math. Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
23	Ruixia Wang	Extremal digraphs on Woodall-type condition for Hamiltonian cycles in balanced bipartite digraphs.	J. Graph Theory	2021	DBLP DOI BibTeX RDF
23	Frank Gurski, Dominique Komander, Marvin Lindemann	Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs.	WALCOM	2021	DBLP DOI BibTeX RDF
23	Xiuwen Yang, Ligong Wang 0001	Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs.	Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
23	Stephan Dominique Andres	On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs.	AKCE Int. J. Graphs Comb.	2020	DBLP DOI BibTeX RDF
23	Cristina Dalfó	From Subkautz Digraphs to Cyclic Kautz Digraphs.	J. Interconnect. Networks	2018	DBLP DOI BibTeX RDF
23	Marcel Abas, Tomás Vetrík	Large Cayley digraphs and bipartite Cayley digraphs of odd diameters.	Discret. Math.	2017	DBLP DOI BibTeX RDF
23	Hortensia Galeana-Sánchez, Mika Olsen	CKI-Digraphs, Generalized Sums and Partitions of Digraphs.	Graphs Comb.	2016	DBLP DOI BibTeX RDF
23	Tay-Woei Shyu	Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length.	Graphs Comb.	2015	DBLP DOI BibTeX RDF
23	Thamodharan Govindan, Appu Muthusamy	Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs.	Discret. Math. Algorithms Appl.	2015	DBLP DOI BibTeX RDF
23	Shiying Wang, Ruixia Wang	Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs.	Discuss. Math. Graph Theory	2013	DBLP DOI BibTeX RDF
23	César Hernández-Cruz	4-transitive digraphs I: the structure of strong 4-transitive digraphs.	Discuss. Math. Graph Theory	2013	DBLP DOI BibTeX RDF
23	Shiying Wang, Ruixia Wang	Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs.	Discret. Math.	2011	DBLP DOI BibTeX RDF
23	Mahyar R. Malekpour	A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs: A Self-Stabilizing Distributed Clock Synchronization Protocol For Arbitrary Digraphs.	PRDC	2011	DBLP DOI BibTeX RDF
23	Mária Zdímalová, Lubica Staneková	Which Faber-Moore-Chen digraphs are Cayley digraphs?	Discret. Math.	2010	DBLP DOI BibTeX RDF
23	Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey	Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs.	Australas. J Comb.	2010	DBLP BibTeX RDF
23	Yubin Gao, Yanling Shao	Double vertex digraphs of digraphs.	Discret. Math.	2009	DBLP DOI BibTeX RDF
23	Haiying Wang, Liang Sun	New results on the eccentric digraphs of the digraphs.	Ars Comb.	2008	DBLP BibTeX RDF
23	B. P. Tan	On semicomplete multipartite digraphs whose king sets are semicomplete digraphs.	Discret. Math.	2008	DBLP DOI BibTeX RDF
23	Yosuke Kikuchi, Yukio Shibata	On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
23	Nicolas Lichiardopol	Echange total, diffusion et quelques résultats sur les itérés de line-digraphs. (Total exchange, broadcasting and some results on iterated line digraphs).		2003	RDF
23	Jørgen Bang-Jensen, Anders Yeo	The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.	J. Algorithms	2001	DBLP DOI BibTeX RDF
23	Josep M. Brunat, Montserrat Maureso	Endo-circulant digraphs of degree two and Cayley digraphs on finite abelian groups.	Discret. Math.	2000	DBLP DOI BibTeX RDF
23	Jørgen Bang-Jensen	Linkages in locally semicomplete digraphs and quasi-transitive digraphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
23	Dominique Barth, Marie-Claude Heydemann	A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.	Discret. Appl. Math.	1997	DBLP DOI BibTeX RDF
23	Dominique Barth, Marie-Claude Heydemann	A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.	Discret. Appl. Math.	1997	DBLP DOI BibTeX RDF
23	Hortensia Galeana-Sánchez, Victor Neumann-Lara	KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition.	Discuss. Math. Graph Theory	1996	DBLP DOI BibTeX RDF
23	Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis	Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF
23	Hortensia Galeana-Sánchez, Victor Neumann-Lara	New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs.	Graphs Comb.	1994	DBLP DOI BibTeX RDF
23	Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald	Infinite highly arc transitive digraphs and universal covering digraphs.	Comb.	1993	DBLP DOI BibTeX RDF
23	Miguel Angel Fiol	On super-edge-connected digraphs and bipartite digraphs.	J. Graph Theory	1992	DBLP DOI BibTeX RDF
23	Hortensia Galeana-Sánchez, Victor Neumann-Lara	Extending kernel perfect digraphs to kernel perfect critical digraphs.	Discret. Math.	1991	DBLP DOI BibTeX RDF
23	Lowell W. Beineke, Christina Zamfirescu	Connection digraphs and second-order line digraphs.	Discret. Math.	1982	DBLP DOI BibTeX RDF
23	Kenneth A. Berman	Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths.	Discret. Math.	1978	DBLP DOI BibTeX RDF
23	Lowell W. Beineke, Robert L. Hemminger	Infinite digraphs isomorphic with their line digraphs.	J. Comb. Theory, Ser. B	1976	DBLP DOI BibTeX RDF
23	Paul Balister, Stefanie Gerke, Gregory Z. Gutin	Convex Sets in Acyclic Digraphs.	Order	2009	DBLP DOI BibTeX RDF	Acyclic diagraphs, Convex sets
23	Tamara Mchedlidze, Antonios Symvonis	Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs.	ISAAC	2009	DBLP DOI BibTeX RDF
23	Tamara Mchedlidze, Antonios Symvonis	Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.	COCOON	2009	DBLP DOI BibTeX RDF
23	Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis	Computing Upward Topological Book Embeddings of Upward Planar Digraphs.	ISAAC	2007	DBLP DOI BibTeX RDF