Search results for "digraph"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Kenjiro Takazawa	A weighted even factor algorithm.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C27, 05C70
21	David Avis, Bohdan Kaluzny	Computing monotone disjoint paths on polytopes.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy
21	Yangjun Chen	A new method for generating compressed representation of transitive closure.	C3S2E	2008	DBLP DOI BibTeX RDF
21	Jianqin Zhou, Wenjuan Wang	On Constructions of Optimal Double-Loop Networks.	ICIC (2)	2008	DBLP DOI BibTeX RDF	tight optimal, L-shaped tile, algorithm, Diameter, double-loop network
21	Deke Guo, Yunhao Liu 0001, Xiang-Yang Li 0001	BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
21	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
21	Gregory Z. Gutin, Igor Razgon, Eun Jung Kim 0002	Minimum Leaf Out-Branching Problems.	AAIM	2008	DBLP DOI BibTeX RDF
21	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
21	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
21	Massimo Melucci, Luca Pretto	PageRank: When Order Changes.	ECIR	2007	DBLP DOI BibTeX RDF
21	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
21	Kai Chen 0009, Fan Jiang 0005, Chuan-dong Huang	A new method of generating synchronizable test sequences that detect output-shifting faults based on multiple UIO sequences.	SAC	2006	DBLP DOI BibTeX RDF	output-shifting faults, synchronization problems, distributed system, conformance testing, FSM
21	Kai Chen 0009, Fan Jiang 0005, Chuan-dong Huang, Zongyao Tang, Yang Qin	Testing a Distributed System: Generating Test Sequences without Potential Controllability and Observability Problems.	ICN/ICONS/MCL	2006	DBLP DOI BibTeX RDF
21	Manuel Bodirsky, Daniel Král	Locally Consistent Constraint Satisfaction Problems with Binary Constraints.	WG	2005	DBLP DOI BibTeX RDF
21	Chuan-dong Huang, Fan Jiang 0005	Generating Minimal Synchronizable Test Sequence That Detects Output-Shifting Faults.	ICCNMC	2005	DBLP DOI BibTeX RDF
21	Ling Chen 0005, Li Tu, Yixin Chen 0001	An Ant Clustering Method for a Dynamic Database.	ICMLC	2005	DBLP DOI BibTeX RDF
21	Shi-Ning Ju, Cheng-Liang Chen, Chuei-Tin Chang	Constructing fault trees for advanced process control systems $application to cascade control loops.	IEEE Trans. Reliab.	2004	DBLP DOI BibTeX RDF
21	Jørgen Bang-Jensen, Anders Yeo	Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C20, 05C70, 05C38, 05C40
21	Mikkel Thorup	Compact oracles for reachability and approximate distances in planar digraphs.	J. ACM	2004	DBLP DOI BibTeX RDF	reachability and shortest paths oracles, Planar graphs
21	Harold N. Gabow	Special edges, and approximating the smallest directed k-edge connected spanning subgraph.	SODA	2004	DBLP BibTeX RDF
21	Raphael Yuster, Uri Zwick	Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.	SODA	2004	DBLP BibTeX RDF
21	Zeev Nutov, Raphael Yuster	Packing Directed Cycles Efficiently.	MFCS	2004	DBLP DOI BibTeX RDF
21	Pierre Fraigniaud, David Ilcinkas	Digraphs Exploration with Little Memory.	STACS	2004	DBLP DOI BibTeX RDF
21	John A. Rose, Mitsunori Takano, Masami Hagiya, Akira Suyama	A DNA Computing-based Genetic Program for In Vitro Protein Evolution via Constrained Pseudomodule Shuffling.	Genet. Program. Evolvable Mach.	2003	DBLP DOI BibTeX RDF
21	Béla Bollobás, Don Coppersmith, Michael Elkin	Sparse distance preservers and additive spanners.	SODA	2003	DBLP BibTeX RDF
21	Yus Mochamad Cholily, Edy Tri Baskoro, Saladin Uttunggadewa	Some Conditions for the Existence of ( d, k)-Digraphs.	IJCCGGT	2003	DBLP DOI BibTeX RDF
21	Lars Arge, Laura Toma, Norbert Zeh	I/O-efficient topological sorting of planar DAGs.	SPAA	2003	DBLP DOI BibTeX RDF	I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition
21	Wen-Huei Chen, Cho-Ching Lu	Executable test sequence for the protocol control and data flow property with overlapping.	ISCC	2002	DBLP DOI BibTeX RDF	SCP tour, Conformance testing, EFSM
21	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
21	Surender Baswana, Ramesh Hariharan, Sandeep Sen	Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.	STOC	2002	DBLP DOI BibTeX RDF	BFS tree, decremental, reachability
21	Jaime D. L. Caro, Tedros Weldemicael Zeratsion	On the Diameter of a Class of the Generalized de Bruijn Graphs.	ISPAN	2002	DBLP DOI BibTeX RDF
21	Robert T. Firla, Bianca Spille, Robert Weismantel	Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
21	David Coudert, Afonso Ferreira, Stephane Perennes	De Bruijn Isomorphisms and Free Space Optical Networks.	IPDPS	2000	DBLP DOI BibTeX RDF
21	James Abello, Jeffrey L. Korn	Visualizing Massive Multi-Digraphs.	INFOVIS	2000	DBLP DOI BibTeX RDF	visualization, graphs, hierarchies, out-of-core algorithms, massive data sets
21	Dora Giammarresi, Jean-Luc Ponty, Derick Wood	Thompson Digraphs: A Characterization.	WIA	1999	DBLP DOI BibTeX RDF
21	Daniela Ferrero	A Technique for the (d, s, N)-Bus Network Problem.	SCCC	1999	DBLP DOI BibTeX RDF
21	Mariusz Meszka, Zdzislaw Skupien	Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C70, 05C20
21	Yih-Lang Li, Cheng-Wen Wu	Cellular automata for efficient parallel logic and fault simulation.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
21	Zhijian Zhu, James A. McHugh, Jason T. L. Wang, Peter A. Ng	A formal approach to modeling office information systems.	J. Syst. Integr.	1994	DBLP DOI BibTeX RDF	office information systems, document type, filing and retrieval, directed acyclic graph, predicates, document model
21	Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis	Computing Shortest Paths and Distances in Planar Graphs.	ICALP	1991	DBLP DOI BibTeX RDF
21	Klaus Simon	An Improved Algorithm for Transitive Closure on Acyclic Digraphs.	ICALP	1986	DBLP DOI BibTeX RDF
21	Alfs T. Berztiss	A Backtrack Procedure for Isomorphism of Directed Graphs.	J. ACM	1973	DBLP DOI BibTeX RDF
19	Derrick Stolee, Chris Bourke, N. V. Vinodchandran	A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.	CCC	2010	DBLP DOI BibTeX RDF	acyclic digraph, logspace algorithm, planar graph, reachability
19	Hubertus Th. Jongen, Alina Ruíz Jhones	Topology of Global Optimization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Karush-Kuhn-Tucker point, Morse relations, Euler formula, Continuous selection of functions, Min-max graph, Min-max digraph, Projected positive gradient, Projected negative gradient, Ascent flow, Descent flow, Global optimization, Morse theory
19	Paul Tarau	An embedded declarative data transformation language.	PPDP	2009	DBLP DOI BibTeX RDF	computational mathematics, dag and hypergraph encodings, functions and permutations, goedel numberings, hereditarily finite sets, pairing functions, prolog data representations, ranking/unranking bijections, digraph
19	Nicolas Beldiceanu, Pierre Flener, Xavier Lorca	Combining Tree Partitioning, Precedence, and Incomparability Constraints.	Constraints An Int. J.	2008	DBLP DOI BibTeX RDF	Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem
19	Gábor Kun, Jaroslav Nesetril	NP by Means of Lifts and Shadows.	MFCS	2007	DBLP DOI BibTeX RDF	duality, Constraint Satisfaction Problem, homomorphism, Digraph, NP
19	Kono Kim, Yeohoon Yoon, Harksoo Kim, Jungyun Seo	Named Entity Recognition Using Acyclic Weighted Digraphs: A Semi-supervised Statistical Method.	PAKDD	2007	DBLP DOI BibTeX RDF	semi-supervised statistical method, acyclic weighted digraph, named entity recognition
19	Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampon	Chain Dominated Orders.	Order	2006	DBLP DOI BibTeX RDF	covering relation, jump number, transitive reduction, truncated lattice, visibility relation, dimension, partially ordered set, digraph, convex set, interval order
19	M. G. Karunambigai, Appu Muthusamy	On Resolvable Multipartite G-Designs II.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Cycle-factorization, Wreath product of graphs, Complete symmetric k?partite multi-digraph, Resolvable multipartite G -design
19	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
19	M. Giraudet, John Kenneth Truss	Okhuma Graphs and Coloured Chains.	Order	2004	DBLP DOI BibTeX RDF	Okhuma, uniquely transitive, graph, digraph, chain, colour
19	Bruno Bachelet, Philippe Mahey	Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs.	4OR	2004	DBLP DOI BibTeX RDF	Minimum cost tension, two-terminal series-parallel digraph, series-parallel recognition, out-of-kilter algorithm, graph decomposition
19	Josep M. Brunat, Antonio Montes	The characteristic ideal of a finite, connected, regular graph.	ISSAC	2004	DBLP DOI BibTeX RDF	characteristic ideal, galois graph, polynomial digraph, polynomial graph, strongly polynomial graph, variety of a pairing, pairing, connected component, conjecture
19	Byron Dom, Iris Eiron, Alex Cozzi, Yi Zhang	Graph-based ranking algorithms for e-mail expertise analysis.	DMKD	2003	DBLP DOI BibTeX RDF	digraph node ranking, ordered list distance, social network analysis, expert finding
19	Guoping Liu 0004, Kyungsook Y. Lee, Harry F. Jordan	n-Dimensional Processor Arrays with Optical dBuses.	J. Supercomput.	2000	DBLP DOI BibTeX RDF	de Bruijn digraph, wavelength division multiplexing, optical interconnections, processor array, time division multiplexing
19	Harold N. Gabow	Using Expander Graphs to Find Vertex Connectivity.	FOCS	2000	DBLP DOI BibTeX RDF	nesting properties, separation triples, computational complexity, complexity, graph theory, expander graphs, undirected graph, digraph, time bound, vertex connectivity
19	I. Scott MacKenzie, Shawn X. Zhang	The Design and Evaluation of a High-Performance Soft Keyboard.	CHI	1999	DBLP DOI BibTeX RDF	digraph probabilities, linguistic models, Fitts' law, mobile systems, pen input, soft keyboards, stylus input
19	H. E. Escuardro, Felix P. Muga II	Wide-diameter of generalized undirected de Bruijn graph UGB(n, n2).	ISPAN	1997	DBLP DOI BibTeX RDF	undirected, graph theory, digraph, de Bruijn graph, wide-diameter
19	Monika Rauch Henzinger, Satish Rao, Harold N. Gabow	Computing Vertex Connectivity: New Bounds from Old Techniques.	FOCS	1996	DBLP DOI BibTeX RDF	smallest number of vertices, preflow push algorithm, computational geometry, deterministic algorithm, digraph, error probability, vertex connectivity
19	David Eppstein	Finding the k Shortest Paths	FOCS	1994	DBLP DOI BibTeX RDF	maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths
19	Nen-Fu Huang	On the Complexity of Two Circle Strongly Connecting Problems.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	circle strongly connecting problems, demand points, directed edge, computational complexity, approximation algorithm, complexity, computational geometry, NP-hard, directed graphs, digraph, plane, radius
19	Klaus Simon	On Minimum Flow and Transitive Reduction.	ICALP	1988	DBLP DOI BibTeX RDF	Minimum flow, transitive reduction, random digraph, transitive closure
19	Kyung-Yong Chwa, S. Louis Hakimi	On Fault Identification in Diagnosable Systems.	IEEE Trans. Computers	1981	DBLP DOI BibTeX RDF	t-diagnosable systems, Characterization of t/t-diagnosable systems, digraph model, fault diagnosis, diagnosis algorithms, system diagnosis
19	Frank DeRemer, Thomas J. Pennello	Efficient computation of LALR(1) look-ahead sets.	SIGPLAN Symposium on Compiler Construction	1979	DBLP DOI BibTeX RDF	LALR(k) grammar, LR(k), Parser, Digraph, Syntactic analysis, Strongly-connected component, Look-ahead, Context-free
19	Thomas J. Pennello, Frank DeRemer	Efficient computation of LALR(1) look-ahead sets (with retrospective)	Best of PLDI	1979	DBLP DOI BibTeX RDF	LALR(k) grammar, LR(k), parser, digraph, syntactic analysis, strongly-connected component, look-ahead, context-free
16	Pierre Aboulker, Quentin Vermande	Various Bounds on the Minimum Number of Arcs in a $k$-Dicritical Digraph.	Electron. J. Comb.	2024	DBLP DOI BibTeX RDF
16	Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald	Digraph redicolouring.	Eur. J. Comb.	2024	DBLP DOI BibTeX RDF
16	Xiaojun Zhao, Qingying Deng, Xiaowang Li	Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network.	Theor. Comput. Sci.	2024	DBLP DOI BibTeX RDF
16	Florian Hörsch, Lucas Picasarri-Arrieta	Complexity results on the decomposition of a digraph into directed linear forests and out-stars.	CoRR	2024	DBLP DOI BibTeX RDF
16	Xunkai Li, Meihao Liao, Zhengyu Wu, Daohan Su, Wentao Zhang, Rong-Hua Li, Guoren Wang	LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning.	CoRR	2024	DBLP DOI BibTeX RDF
16	Xunkai Li, Meihao Liao, Zhengyu Wu, Daohan Su, Wentao Zhang, Ronghua Li, Guoren Wang	LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning.	Proc. VLDB Endow.	2024	DBLP BibTeX RDF
16	Suneet Singh, Akhilesh Barve, Kamalakanta Muduli, Anil Kumar 0008, Sunil Luthra	Evaluating Roadblocks to Implementing a Green Freight Transportation System: An Interval Valued Intuitionistic Fuzzy Digraph Matrix Approach.	IEEE Trans. Engineering Management	2024	DBLP DOI BibTeX RDF
16	Mouhamad El Joubbeh, Salman Ghazal	Existence of paths with t blocks in k(t)-chromatic digraph.	Discret. Appl. Math.	2024	DBLP DOI BibTeX RDF
16	Hilal A. Ganie, Shariefuddin Pirzada	On the first outdegree Zagreb index of a digraph.	Discret. Math.	2024	DBLP DOI BibTeX RDF
16	Danyang Wang, Ping Zhu 0001	Fuzzy rough digraph based on strength of connectedness with application.	Neural Comput. Appl.	2023	DBLP DOI BibTeX RDF
16	Stephan Dominique Andres	Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs.	Discuss. Math. Graph Theory	2023	DBLP DOI BibTeX RDF
16	Junyi Guan, Sheng Li 0005, Xiongxiong He, Jiajia Chen	Clustering by fast detection of main density peaks within a peak digraph.	Inf. Sci.	2023	DBLP DOI BibTeX RDF
16	Weihua Li 0009, Huaguang Zhang, Yunfei Mu, Yingchun Wang	Bipartite Time-Varying Output Formation Tracking for Multiagent Systems With Multiple Heterogeneous Leaders Under Signed Digraph.	IEEE Trans. Ind. Informatics	2023	DBLP DOI BibTeX RDF
16	Yan Zhang, Guojiang Shen, Xiao Han 0004, Wei Wang 0077, Xiangjie Kong 0001	Spatio-Temporal Digraph Convolutional Network-Based Taxi Pickup Location Recommendation.	IEEE Trans. Ind. Informatics	2023	DBLP DOI BibTeX RDF
16	Yiling Dong	Precise Values for the Strong Subgraph 3-Arc-Connectivity of Cartesian Products of Some Digraph Classes.	J. Interconnect. Networks	2023	DBLP DOI BibTeX RDF
16	Hilal A. Ganie, Yilun Shang	On the Laplacian and Signless Laplacian Characteristic Polynomials of a Digraph.	Symmetry	2023	DBLP DOI BibTeX RDF
16	Hong Wang 0005, Yun Wang, Jin Yan	Disjoint Cycles in a Digraph with Partial Degree.	SIAM J. Discret. Math.	2023	DBLP DOI BibTeX RDF
16	Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard	Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree.	J. Comput. Syst. Sci.	2023	DBLP DOI BibTeX RDF
16	Lucas Picasarri-Arrieta	Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring.	CoRR	2023	DBLP DOI BibTeX RDF
16	Svante Janson	On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution.	CoRR	2023	DBLP DOI BibTeX RDF
16	Amanul Islam, Fazidah Othman, Nazmus Sakib, Hafiz Md. Hasan Babu	Prevention of shoulder-surfing attacks using shifting condition using digraph substitution rules.	CoRR	2023	DBLP DOI BibTeX RDF
16	Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud	On the minimum number of inversions to make a digraph k-(arc-)strong.	CoRR	2023	DBLP DOI BibTeX RDF
16	Hyungsoo Kang, Isaac Kaminer, Venanzio Cichella, Naira Hovakimyan	Coordinated Path Following of UAVs using Event-Triggered Communication over Time-Varying Networks with Digraph Topologies.	CoRR	2023	DBLP DOI BibTeX RDF
16	Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald	Digraph redicolouring.	CoRR	2023	DBLP DOI BibTeX RDF
16	Pierre Aboulker, Guillaume Aubian, Pierre Charbit	Digraph Colouring and Arc-Connectivity.	CoRR	2023	DBLP DOI BibTeX RDF
16	Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo	Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem.	CoRR	2023	DBLP DOI BibTeX RDF
16	Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard	Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree.	CoRR	2023	DBLP DOI BibTeX RDF
16	Sayani Ghosh, Bradley S. Meyer	Digraph Branchings and Matrix Determinants.	CoRR	2023	DBLP DOI BibTeX RDF
16	Deva Nithyanandham, Felix Augustin, David Raj Micheal, Nagarajan Deivanayagam Pillai	Energy based bipolar intuitionistic fuzzy digraph decision-making system in selecting COVID-19 vaccines.	Appl. Soft Comput.	2023	DBLP DOI BibTeX RDF
16	Ruijuan Gu, Hui Lei 0002, Xiaopan Lian, Zhenyu Taoqiu	Weak-odd chromatic index of special digraph classes.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
16	Shuya Chiba	Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
16	Yonglin Hao, Qingju Wang 0001, Lin Jiao, Xinxin Gong	Approximate Modeling of Signed Difference and Digraph based Bit Condition Deduction: New Boomerang Attacks on BLAKE.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
16	Yue Fan, Huiwen Wang, Lihong Wang, Shu Guo, Jing Liu	A novel trajectory similarity measurement method based on node-sequence hierarchical digraph.	Trans. GIS	2023	DBLP DOI BibTeX RDF
16	Mattia G. Bergomi, Massimo Ferri	Exploring Graph and Digraph Persistence.	Algorithms	2023	DBLP DOI BibTeX RDF