Search results for "Digraph"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
99	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
80	Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson	Proper Down-Coloring Simple Acyclic Digraphs.	AGTIVE	2003	DBLP DOI BibTeX RDF	multidimensional clustering, acyclic digraph, ancestor, descendant, down-set, Relational databases, indexing, hypergraph, poset, digraph, vertex coloring, bitmap indexing
69	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
64	Walter Didimo	Computing Upward Planar Drawings Using Switch-Regularity Heuristics.	SOFSEM	2005	DBLP DOI BibTeX RDF
64	Toru Hasunuma	Laying Out Iterated Line Digraphs Using Queues.	GD	2003	DBLP DOI BibTeX RDF
61	Boting Yang, Yi Cao	Monotonicity of strong searching on digraphs.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Cops-and-robber game, Pursuit-and-evasion problem, NP-complete, Monotonicity, Graph searching, Digraph
59	Boting Yang, Yi Cao	Digraph Strong Searching: Monotonicity and Complexity.	AAIM	2007	DBLP DOI BibTeX RDF
54	Stephan Kreutzer, Sebastian Ordyniak	Digraph Decompositions and Monotonicity in Digraph Searching.	WG	2008	DBLP DOI BibTeX RDF
53	Deli Zhao, Zhouchen Lin, Xiaoou Tang	Contextual Distance for Data Perception.	ICCV	2007	DBLP DOI BibTeX RDF
51	Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre de Miquel	Line Digraph Iterations and the (d, k) Digraph Problem.	IEEE Trans. Computers	1984	DBLP DOI BibTeX RDF	(d, k) graph problem, line digraph, Moore bound, routing algorithm, Communication network
48	Nicola Pio Belfiore, Umberto Berti, Aldo Mondino, Matteo Verotti	A Comprehensive Evaluation of the Efficiency of an Integrated Biogas, Trigen, PV and Greenhouse Plant, Using Digraph Theory.	Towards Intelligent Engineering and Information Technology	2009	DBLP DOI BibTeX RDF
48	Zhibo Ren, Qiang Zhang, Xiujuan Ma	Efficiently Mining Maximal Frequent Itemsets Based on Digraph.	FSKD (2)	2007	DBLP DOI BibTeX RDF
48	Genjiu Xu, Xueliang Li 0001, Shenggui Zhang	The Binding Number of a Digraph.	CJCDGCGT	2005	DBLP DOI BibTeX RDF	Binding number, Caccetta-Häggkvist Conjecture, directed graph, girth
48	Ling Chen 0005, Li Tu, Hongjian Chen	A Novel Ant Clustering Algorithm with Digraph.	ICNC (2)	2005	DBLP DOI BibTeX RDF
48	Hsun-Wen Chang, Pei-Fang Tsai	Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	DNA digraph, Reduced digraph, Pattern graph, Combinatorial enumeration, Catalan number, Repeat, DNA sequencing
46	Xiao Ming Zhou, Chuan-Heng Ang, Tok Wang Ling	Dynamic interactive spatial similarity retrieval in iconic image databases using enhanced digraph.	SAC	2006	DBLP DOI BibTeX RDF	enhanced digraph, iconic image databases, interactive, spatial relationship, similarity retrieval
46	Peter Borm, René van den Brink, Marco Slikker	An Iterative Procedure for Evaluating Digraph Competitions.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	digraph competitions, limit measure, relational power measure, stochastic processes, cooperative games, Shapley value
46	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
43	Tamara Mchedlidze, Antonios Symvonis	Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs.	ISAAC	2009	DBLP DOI BibTeX RDF
43	Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann	On Making Directed Graphs Transitive.	WADS	2009	DBLP DOI BibTeX RDF
43	Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001	Better Algorithms and Bounds for Directed Maximum Leaf Problems.	FSTTCS	2007	DBLP DOI BibTeX RDF
43	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
40	Arvind Gupta, Pavol Hell, Mehdi Karimi 0001, Arash Rafiey	Minimum Cost Homomorphisms to Reflexive Digraphs.	LATIN	2008	DBLP DOI BibTeX RDF	minimum cost homomorphism, reflexive digraph, NP-completeness, polynomial time algorithm, homomorphism, dichotomy
38	Ikno Kim, Junzo Watada	A Biologically Intelligent Encoding Approach to a Hierarchical Classification of Relational Elements in a Digraph.	KES (2)	2009	DBLP DOI BibTeX RDF
38	Nadja Betzler, Johannes Uhlmann	Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems.	COCOA	2008	DBLP DOI BibTeX RDF
38	Jin-Myung Won, Fakhreddine Karray	A Genetic Algorithm with cycle representation and contraction digraph model for Guideway Network design of Personal Rapid Transit.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
38	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
38	Albert Atserias	On Digraph Coloring Problems and Treewidth Duality.	LICS	2005	DBLP DOI BibTeX RDF
38	Ventsi G. Rumchev	Positive Linear Systems Reachability Criterion in Digraph Form.	POSTA	2003	DBLP DOI BibTeX RDF
38	András Frank, Tibor Jordán	How to Make a Strongly Connected Digraph Two-Connected.	IPCO	1995	DBLP DOI BibTeX RDF
38	V. V. Dixit	EDNA: Expert Digraph Network Analysis.	IEA/AIE (Vol. 1)	1990	DBLP DOI BibTeX RDF
35	Michael Lampis, Georgia Kaouri, Valia Mitsou	On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures.	ISAAC	2008	DBLP DOI BibTeX RDF	Digraph decompositions, Treewidth, Parameterized Complexity
35	Carles Padró, Paz Morillo, Miguel Angel Fiol	Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs".	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF	diameter-vulnerability, line digraph iteration, fault-tolerance, Connectivity, spread
35	Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu	Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	de Bruijn digraphs, digraph iterations, connectivity analysis, optimal general theorem, optimal bounds, length-bound disjoint paths, graph theory, iterative methods, directed graphs, node-disjoint paths, Kautz graphs
35	Miguel Angel Fiol, Anna S. Lladó	The Partial Line Digraph Technique in the Design of Large Interconnection Networks.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	partial line digraph technique, large interconnection networks, maximum out-degree, Kautz digraphs, distributed systems, design, routing, connectivity, multiprocessor interconnection networks, directed graphs, expandability
33	Marcel Jackson, Tomasz Kowalski, Todd Niven	Digraph related constructions and the complexity of digraph homomorphism problems	CoRR	2013	DBLP BibTeX RDF
33	Huiping Cai, Juan Liu 0001, Jixiang Meng	Domination number in iterated line digraph of a complete bipartite digraph.	Ars Comb.	2012	DBLP BibTeX RDF
33	Stephan Kreutzer, Sebastian Ordyniak	Digraph decompositions and monotonicity in digraph searching.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
33	Yuuki Tanaka, Yukio Shibata	The Cayley digraph associated to the Kautz digraph.	Ars Comb.	2010	DBLP BibTeX RDF
33	Linda Marshall, Derrick G. Kourie	Deriving a digraph isomorphism for digraph compliance measurement.	SAICSIT	2010	DBLP DOI BibTeX RDF
33	Juan Liu 0001, Lin Sun, Jixiang Meng	A line digraph of a complete bipartite digraph.	Appl. Math. Lett.	2009	DBLP DOI BibTeX RDF
33	Stephan Kreutzer, Sebastian Ordyniak	Digraph Decompositions and Monotonicity in Digraph Searching	CoRR	2008	DBLP BibTeX RDF
33	Simone Severini	On the structure of the adjacency matrix of the line digraph of a regular digraph.	Discret. Appl. Math.	2006	DBLP DOI BibTeX RDF
33	Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo	Algebraic properties of a digraph and its line digraph.	J. Interconnect. Networks	2003	DBLP DOI BibTeX RDF
33	Fuji Zhang, Guoning Lin	When a digraph and its line digraph are connected and cospectral.	Discret. Math.	1998	DBLP DOI BibTeX RDF
33	Doug Mahar, Renee Napier, Michael Wagner 0004, William Laverty, Ron Henderson, Michael Hiron	Optimizing digraph-latency based biometric typist verification systems: inter and intra typist differences in digraph latency distributions.	Int. J. Hum. Comput. Stud.	1995	DBLP DOI BibTeX RDF
33	Masatosi Imori, Makoto Matsumoto, Hisao Yamada	The line digraph of a regular and pancircular digraph is also regular and pancircular.	Graphs Comb.	1988	DBLP DOI BibTeX RDF
32	Paul Balister, Stefanie Gerke, Gregory Z. Gutin	Convex Sets in Acyclic Digraphs.	Order	2009	DBLP DOI BibTeX RDF	Acyclic diagraphs, Convex sets
32	Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff	Transitive-closure spanners.	SODA	2009	DBLP DOI BibTeX RDF
32	Tamara Mchedlidze, Antonios Symvonis	Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.	WALCOM	2009	DBLP DOI BibTeX RDF
32	Tamara Mchedlidze, Antonios Symvonis	Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.	COCOON	2009	DBLP DOI BibTeX RDF
32	Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	On the Directed Degree-Preserving Spanning Tree Problem.	IWPEC	2009	DBLP DOI BibTeX RDF
32	Raymond Bisdorff, Patrick Meyer, Marc Roubens	R UBIS : a bipolar-valued outranking method for the choice problem.	4OR	2008	DBLP DOI BibTeX RDF	MSC Classification (2000) 05C20, 90B50
32	Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan	Unconditionally reliable message transmission in directed networks.	SODA	2008	DBLP BibTeX RDF
32	Aimal Rextin, Patrick Healy	A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs.	GD	2008	DBLP DOI BibTeX RDF
32	Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis	Computing Upward Topological Book Embeddings of Upward Planar Digraphs.	ISAAC	2007	DBLP DOI BibTeX RDF
32	Daniela Ferrero	Some properties of superline digraphs.	ITNG	2007	DBLP DOI BibTeX RDF
32	Farshad Rum, Brandon W. Gordon, Mohammad Eghtesad	Consensus in Noisy Switching Directed Networks with Time-Delays.	ICNSC	2007	DBLP DOI BibTeX RDF
32	Yangjun Chen, Donovan Cooke	On the transitive closure representation and adjustable compression.	SAC	2006	DBLP DOI BibTeX RDF	databases, directed acyclic graphs, transitive closures, graph decomposition, branchings, topological order
32	Saverio Caminiti, Rossella Petreschi	String Coding of Trees with Locality and Heritability.	COCOON	2005	DBLP DOI BibTeX RDF
32	Weizhen Gu, Xingde Jia	On a Traffic Control Problem.	ISPAN	2005	DBLP DOI BibTeX RDF
32	Abraham Flaxman, Alan M. Frieze	The Diameter of Randomly Perturbed Digraphs and Some Applications..	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
32	Carlos E. R. Alves, Edson Cáceres, Amaury Antônio de Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter	Efficient Parallel Implementation of Transitive Closure of Digraphs.	PVM/MPI	2003	DBLP DOI BibTeX RDF
32	Robert E. Jamison	Transforming Toric Digraphs.	AGTIVE	2003	DBLP DOI BibTeX RDF
32	Sven Hartmann	Orthogonal Decompositions of Complete Digraphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
32	Gregory Z. Gutin, Anders Yeo	Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
32	Romeo Rizzi	Excluding a Simple Good Pair Approach to Directed Cuts.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
32	Bertrand Guenin	Circuit Mengerian Directed Graphs.	IPCO	2001	DBLP DOI BibTeX RDF
32	Sounaka Mishra, Kripasindhu Sikdar	On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.	IFIP TCS	2000	DBLP DOI BibTeX RDF	NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness
32	Claus-Peter Schnorr, C. R. Subramanian 0001	Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).	RANDOM	1998	DBLP DOI BibTeX RDF
32	Erich Prisner	Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.	WG	1997	DBLP DOI BibTeX RDF
32	Hermann Stamm	On Feedback Problems in Planar Digraphs.	WG	1990	DBLP DOI BibTeX RDF
32	F. Evans, Jan Jantzen	A Structured Approach to Analysis and Design of Complex Systems.	APL	1990	DBLP DOI BibTeX RDF	APL
32	Ewald Speckenmeyer	On Feedback Problems in Diagraphs.	WG	1989	DBLP DOI BibTeX RDF
32	Jan Jantzen	Inference Planning Using Digraphs and Boolean Arrays.	APL	1989	DBLP DOI BibTeX RDF	APL
29	Boting Yang, Yi Cao	Standard directed search strategies and their applications.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Oriented grids, Pursuit-evasion problem, Digraph, Directed search
29	Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag	Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Transitive reduction of directed graphs, Minimum equivalent digraph, (Biological) signal transduction networks, Approximation algorithms
29	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
29	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
29	Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001	Minimum k Arborescences with Bandwidth Constraints.	Algorithmica	2004	DBLP DOI BibTeX RDF	Arborescence, Polymatroid intersection, Algorithm and complexity, Maximum flow, Matroid, Digraph, Polymatroid
29	Appu Muthusamy	On Resolvable Multipartite G-Designs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Cycle-factorization, Wreath product of graphs, Complete symmetric k-partite multi-digraph, Resesolvable multipartite G-design
29	Miika Silfverberg, I. Scott MacKenzie, Panu Korhonen	Predicting text entry speed on mobile phones.	CHI	2000	DBLP DOI BibTeX RDF	digraph frequencies, mobile phones, text entry, Fitts' law, mobile systems, human performance modeling, keypad input
29	Daniela Ferrero, Carles Padró	Fault-Tolerant Routings in Large Generalized Cycles.	SCCC	1997	DBLP DOI BibTeX RDF	fault-tolerant routing algorithms, de Bruijn generalized cycles, Kautz generalized cycles, generalized p-cycle, vertex set partitioning, faulty elements, directed graphs, diameter, digraph, ordered set, path length
29	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
29	Ernst W. Mayr	Scheduling interval orders in parallel.	HICSS (2)	1995	DBLP DOI BibTeX RDF	interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems
27	Hermann Gruber, Markus Holzer 0001	Finite Automata, Digraph Connectivity, and Regular Expression Size.	ICALP (2)	2008	DBLP DOI BibTeX RDF
27	Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo	An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph.	WG	2008	DBLP DOI BibTeX RDF
27	Jud Leonard, Avi Purkayastha, Matt Reilly, Tushar Mohan	The software interface for a cluster interconnect based on the Kautz digraph.	CLUSTER	2007	DBLP DOI BibTeX RDF
27	János Barát	Directed Path-width and Monotonicity in Digraph Searching.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Search games, Path-width, Cops-and-robber games, Directed graph, Monotonicity
27	E. M. Kelly, Lisa M. Bartlett	Application of the Digraph Method in System Fault Diagnostics.	ARES	2006	DBLP DOI BibTeX RDF	Fault Diagnosis, Availability, Failure Detection, Digraphs
27	Rudolf Müller, Andreas S. Schulz	The Interval Order Polytope of a Digraph.	IPCO	1995	DBLP DOI BibTeX RDF
27	Klaus Simon, Davide Crippa, Fabian Collenberg	On the Distribution of the Transitive Closure in a Random Acyclic Digraph.	ESA	1993	DBLP DOI BibTeX RDF
27	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
27	Paul G. Spirakis, Athanasios K. Tsakalidis	A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph.	ICALP	1986	DBLP DOI BibTeX RDF
21	Sarmad Abbasi, Patrick Healy, Aimal Rextin	An Improved Upward Planarity Testing Algorithm and Related Applications.	WALCOM	2009	DBLP DOI BibTeX RDF
21	Marc Christie, Fabrice Lamarche, Frédéric Benhamou	A Spatio-temporal Reasoning System for Virtual Camera Planning.	Smart Graphics	2009	DBLP DOI BibTeX RDF
21	Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin	Average-Case Analyses of Vickrey Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST
21	Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim 0002, Saket Saurabh 0001, Anders Yeo	Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem.	COCOON	2009	DBLP DOI BibTeX RDF
21	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
21	Satoru Iwata 0001, Takuro Matsuda	Finding coherent cyclic orders in strong digraphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C20, 90C27