Search results for "digraph"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Yahya Ould Hamidoune	A property of a-fragments of a digraph.	Discret. Math.	1980	DBLP DOI BibTeX RDF
16	Yahya Ould Hamidoune	On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs.	Discret. Math.	1980	DBLP DOI BibTeX RDF
16	Anca Pascu, Gheorghe Paun	On the planarity of bicolored digraph grammar systems.	Discret. Math.	1979	DBLP DOI BibTeX RDF
16	Silvano Martello	An algorithm for finding a minimal equivalent graph of a strongly connected digraph.	Computing	1979	DBLP DOI BibTeX RDF
16	Alan Stickney, Layne T. Watson	Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem.	Math. Oper. Res.	1978	DBLP DOI BibTeX RDF
16	Richard M. Karp	A characterization of the minimum cycle mean in a digraph.	Discret. Math.	1978	DBLP DOI BibTeX RDF
16	Francis T. Boesch, James F. Gimpel	Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization.	J. ACM	1977	DBLP DOI BibTeX RDF
16	Carsten Thomassen	An ore-type condition implying a digraph to be pancyclic.	Discret. Math.	1977	DBLP DOI BibTeX RDF
16	Richard C. O'Brien	An upper bound on the path number of a digraph.	J. Comb. Theory, Ser. B	1977	DBLP DOI BibTeX RDF
16	S. Rao Kosaraju	On independent circuits of a digraph.	J. Graph Theory	1977	DBLP DOI BibTeX RDF
16		Depth-first digraph algorithms without recursion.	SIGCSE-1	1977	DBLP DOI BibTeX RDF
16	Eshrat Arjomandi	On Finding All Unilaterally Connected Components of a Digraph.	Inf. Process. Lett.	1976	DBLP DOI BibTeX RDF
16	Carter Bays	A Non-Recursive Technique for Recreating a Digraph from its K-Formula Representation.	Comput. J.	1976	DBLP DOI BibTeX RDF
16	Brooke Allen	A generalized digraph simulator.	APL	1976	DBLP DOI BibTeX RDF
16	Harry T. Hsu	An Algorithm for Finding a Minimal Equivalent Graph of a Digraph.	J. ACM	1975	DBLP DOI BibTeX RDF
16	E. T. Parker	The Maximum Number of Digraph-Distinct Ordered Quadruples on Six Marks.	J. Comb. Theory, Ser. A	1975	DBLP DOI BibTeX RDF
16	J. Dzikiewicz	Algorithmus 26 An algorithm for finding the transitive closure of a digraph.	Computing	1975	DBLP DOI BibTeX RDF
16	Dennis M. Moyles, Gerald L. Thompson	An Algorithm for Finding a Minimum Equivalent Graph of a Digraph.	J. ACM	1969	DBLP DOI BibTeX RDF
11	Ying Liu, Kari-Jouko Räihä	Predicting Chinese text entry speeds on mobile phones.	CHI	2010	DBLP DOI BibTeX RDF	model, performance, mobile, text entry, chinese, speed
11	Ken-ichi Kawarabayashi, Bruce A. Reed	Odd cycle packing.	STOC	2010	DBLP DOI BibTeX RDF	odd cycle, packing
11	Edward P. F. Chan, Yaya Yang	Shortest Path Tree Computation in Dynamic Graphs.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
11	Takuro Fukunaga, Hiroshi Nagamochi	Network Design with Edge-Connectivity and Degree Constraints.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity
11	Sven Hartmann, Sebastian Link	Efficient reasoning about a robust XML key fragment.	ACM Trans. Database Syst.	2009	DBLP DOI BibTeX RDF	XML key, reachability, axiomatization, implication, XML data
11	Shuliang Zheng, Doingxing Jiang, Qixin Liu	A Role and Activity Based Access Control Model for University Identity and Access Management System.	IAS	2009	DBLP DOI BibTeX RDF
11	Adam Roman	Decision Version of the Road Coloring Problem Is NP-Complete.	FCT	2009	DBLP DOI BibTeX RDF
11	Piotr Berman, Bhaskar DasGupta, Marek Karpinski	Approximating Transitive Reductions for Directed Networks.	WADS	2009	DBLP DOI BibTeX RDF
11	Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha	Kernel in Oriented Circulant Graphs.	IWOCA	2009	DBLP DOI BibTeX RDF	oriented graph, strong kernel number, strongly connected, NP-complete, kernel
11	Jack Edmonds 0001	Branching Systems.	IWOCA	2009	DBLP DOI BibTeX RDF
11	Yixiang Chen, Min Zhang 0007, Hong Zhu 0004, Tian-Ming Bu	Average Transitive Trustworthy Degrees for Trustworthy Networks.	RSKT	2009	DBLP DOI BibTeX RDF
11	Xiangyong Li, Yash P. Aneja	A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks.	COCOA	2009	DBLP DOI BibTeX RDF
11	Huei-Yung Lin, Wen-Cheng Fan-Chiang	Image-Based Techniques for Shredded Document Reconstruction.	PSIVT	2009	DBLP DOI BibTeX RDF
11	Sven Hartmann, Sebastian Link	Expressive, yet tractable XML keys.	EDBT	2009	DBLP DOI BibTeX RDF
11	Jean Daligault, Stéphan Thomassé	On Finding Directed Trees with Many Leaves.	IWPEC	2009	DBLP DOI BibTeX RDF
11	Andrew Zalesky	DT-MRI Fiber Tracking: A Shortest Paths Approach.	IEEE Trans. Medical Imaging	2008	DBLP DOI BibTeX RDF
11	Harold N. Gabow, Shuxin Nie	Finding a long directed cycle.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	circumference, long cycles, Approximation algorithms, cycles, Hamiltonian cycles
11	Maria Flavia Monaco, Marcello Sammarra, Luigi Moccia	Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Basic solutions, Polytopes, Extreme points, Constrained shortest path
11	Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan	Cycles in dense digraphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C20, 05C35, 05C38
11	Bernd Gärtner, Walter D. Morris Jr., Leo Rüst	Unique Sink Orientations of Grids.	Algorithmica	2008	DBLP DOI BibTeX RDF	Unique sink orientation, Generalized linear complementarity problem, Sink finding algorithm, Holt Klee condition, Linear programming
11	Hubertus Th. Jongen, Oliver Stein	Smoothing by mollifiers. Part I: semi-infinite optimization.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	AMS Subject Classification 90C34, 57R12, 90C31
11	Alastair F. Donaldson, Alice Miller 0001	Automatic Symmetry Detection for Promela.	J. Autom. Reason.	2008	DBLP DOI BibTeX RDF	Model checking, Automatic verification, Symmetry reduction, Promela
11	Raymond Bisdorff	On Clustering the Criteria in an Outranking Based Decision Aid Approach.	MCO	2008	DBLP DOI BibTeX RDF
11	Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer	How to Guard a Graph?.	ISAAC	2008	DBLP DOI BibTeX RDF
11	Maxim A. Babenko	An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem.	ISAAC	2008	DBLP DOI BibTeX RDF
11	Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi	Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.	SODA	2008	DBLP BibTeX RDF
11	Maxim A. Babenko, Alexander V. Karzanov	A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem.	ESA	2008	DBLP DOI BibTeX RDF
11	Paul S. Bonsma, Frederic Dorn	Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.	ESA	2008	DBLP DOI BibTeX RDF
11	Lei Wang 0011, Zhiying Wang 0003, Kui Dai	Performance Bound Analysis and Retiming of Timed Circuits.	ICYCS	2008	DBLP DOI BibTeX RDF
11	Animashree Anandkumar, Chatschik Bisdikian, Dakshi Agrawal	Tracking in a spaghetti bowl: monitoring transactions using footprints.	SIGMETRICS	2008	DBLP DOI BibTeX RDF	maximum-likelihood tracking, transaction monitoring, semi-markov process, bipartite matching
11	Tamara Mchedlidze, Antonios Symvonis	Spine Crossing Minimization in Upward Topological Book Embeddings.	GD	2008	DBLP DOI BibTeX RDF
11	Mayur Bubna, Sudip Roy 0002, Naresh Shenoy, Subhra Mazumdar 0002	A layout-aware physical design method for constructing feasible QCA circuits.	ACM Great Lakes Symposium on VLSI	2008	DBLP DOI BibTeX RDF	routing, partitioning, placement, quantum-dot cellular automata
11	Binh-Minh Bui-Xuan, Michel Habib	A Representation Theorem for Union-Difference Families and Application.	LATIN	2008	DBLP DOI BibTeX RDF
11	Boting Yang, Yi Cao	On the Monotonicity of Weak Searching.	COCOON	2008	DBLP DOI BibTeX RDF
11	Gregory Z. Gutin, Arash Rafiey, Anders Yeo	Minimum Cost Homomorphism Dichotomy for Oriented Cycles.	AAIM	2008	DBLP DOI BibTeX RDF
11	Leo Liberti, Franco Raimondi	The Secret Santa Problem.	AAIM	2008	DBLP DOI BibTeX RDF
11	Warren Schudy	Finding strongly connected components in parallel using o(log2n) reachability queries.	SPAA	2008	DBLP DOI BibTeX RDF	transitive closure bottleneck, parallel algorithms, graph algorithms, strongly connected components, topological sort
11	Romualdo Monteiro de Resende Costa, Marcelo Ferreira Moreno, Luiz Fernando Gomes Soares	Intermedia synchronization management in DTV systems.	ACM Symposium on Document Engineering	2008	DBLP DOI BibTeX RDF	intermedia synchronization, middleware, digital TV, NCL, temporal graph
11	Guansheng Xing, Jianxun Zhang, Hao Ju	Consensus-based Strategy for Parallel Motion of Multiple Mobile Robots.	RAM	2008	DBLP DOI BibTeX RDF
11	Mohamed Haouari, Mehdi Mrad, Hanif D. Sherali	Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Synthesis of capacitated networks, Network design, Benders decomposition
11	Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson	On counting homomorphisms to directed acyclic graphs.	J. ACM	2007	DBLP DOI BibTeX RDF	directed acyclic graphs, homomorphisms, Counting
11	Bernard Gendron, Alain Hertz, Patrick St-Louis	On edge orienting methods for graph coloring.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Edge orienting, Local search, Graph coloring
11	Satoru Iwata 0001, Kenjiro Takazawa	The independent even factor problem.	SODA	2007	DBLP BibTeX RDF
11	Yangjun Chen	Tree Encoding and Transitive Closure Compression.	IV	2007	DBLP DOI BibTeX RDF
11	Maren Martens, Fernanda Salazar, Martin Skutella	Convex Combinations of Single Source Unsplittable Flows.	ESA	2007	DBLP DOI BibTeX RDF
11	Angelo Monti, Paolo Penna, Riccardo Silvestri	An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.	WG	2007	DBLP DOI BibTeX RDF	Caccetta-Häggkvist conjecture, online load balancing, competitive analysis
11	Xiaoping Dai, Jianqin Zhou, Kaihou Wang	An Algorithm to Find Optimal Double-Loop Networks with Non-unit Steps.	APPT	2007	DBLP DOI BibTeX RDF	tight optimal, L-shaped tile, non-unit step integer, algorithm, Double-loop network
11	Zhihong He, Guojun Li, Dawei Ding, Quanhui Liu	Componentwise Complementary Cycles in Almost Regular 3-Partite Tournaments.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	almost regular, componentwise complementary cycles, tournament
11	Sven Hartmann, Sebastian Link	Unlocking Keys for XML Trees.	ICDT	2007	DBLP DOI BibTeX RDF
11	Xiaoping Dai, Jianqin Zhou, Xiaolin Wang	Infinite Families of Optimal Double-Loop Networks.	COCOA	2007	DBLP DOI BibTeX RDF	tight optimal, L-shaped tile, non-unit step integer, Double-loop network
11	Colin Cooper, Alan M. Frieze	The Cover Time of Random Digraphs.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
11	Wesley Pegden	Distance Sequences In Locally Infinite Vertex-Transitive Digraphs.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C12
11	Kaviraj Chopra, Sarma B. K. Vrudhula	Efficient Symbolic Algorithms for Computing the Minimum and Bounded Leakage States.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
11	Harold N. Gabow	Using expander graphs to find vertex connectivity.	J. ACM	2006	DBLP DOI BibTeX RDF	graphs, Expander graphs, vertex connectivity
11	Tim Dwyer, Yehuda Koren, Kim Marriott	Drawing Directed Graphs Using Quadratic Programming.	IEEE Trans. Vis. Comput. Graph.	2006	DBLP DOI BibTeX RDF	force directed algorithms, Directed graphs, hierarchy, graph drawing, quadratic programming, majorization
11	Mark Sh. Levin, Mark Last	Design of test inputs and their sequences in multi-function system testing.	Appl. Intell.	2006	DBLP DOI BibTeX RDF	Test input, Test inputs sequences, Multi-function testing, Design, Combinatorial optimization, Decision making, Black-box testing, System approach
11	Rudolf Ahlswede, Harout K. Aydinian	Sparse Asymmetric Connectors in Communication Networks.	GTIT-C	2006	DBLP DOI BibTeX RDF	fault–tolerant connector, connector, rearrangeable network
11	Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson	On Counting Homomorphisms to Directed Acyclic Graphs.	ICALP (1)	2006	DBLP DOI BibTeX RDF
11	Jin Tang 0001, Chunyan Zhang, Bin Luo 0001	A New Approach to Graph Seriation.	ICICIC (3)	2006	DBLP DOI BibTeX RDF
11	Jan Foniok, Jaroslav Nesetril, Claude Tardif	Generalised Dualities and Finite Maximal Antichains.	WG	2006	DBLP DOI BibTeX RDF
11	Zeyao Mo, Aiqing Zhang, Xiaolin Cao	Towards a parallel framework of grid-based numerical algorithms on DAGs.	IPDPS	2006	DBLP DOI BibTeX RDF
11	Xiaozhen Mi, Changgang Yan, Li Jin, Qin Si	Evaluation for Result-Chain Models based on Fuzzy Evaluation Matrix.	CSCWD	2006	DBLP DOI BibTeX RDF
11	Öznur Özkasap, Emine Sule Yazici, Selda Küçükçifçi, Mine Çaglar	Exact Performance Measures for Peer-to-Peer Epidemic Information Diffusion.	ISCIS	2006	DBLP DOI BibTeX RDF	anti-entropy, peer-to-peer, Markov chain, counting, epidemic
11	Takuro Fukunaga, Hiroshi Nagamochi	Network Design with Edge-Connectivity and Degree Constraints.	WAOA	2006	DBLP DOI BibTeX RDF
11	Ling Qin, Jianli Luo, Zhimin Chen, Jing Guo, Ling Chen 0005, Yi Pan 0001	Phelogenetic Tree Construction using Self adaptive Ant Colony Algorithm.	IMSCCS (1)	2006	DBLP DOI BibTeX RDF
11	Omer Reingold, Luca Trevisan, Salil P. Vadhan	Pseudorandom walks on regular digraphs and the RL vs. L problem.	STOC	2006	DBLP DOI BibTeX RDF	universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation
11	Egon Balas, Rüdiger Stephan	On the Cycle Polytope of a Directed Graph and Its Relaxations.	OR	2006	DBLP DOI BibTeX RDF
11	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
11	Orlando Lee, Aaron Williams	Packing Dicycle Covers in Planar Graphs with No K5-e Minor.	LATIN	2006	DBLP DOI BibTeX RDF
11	Jean-François Culus, Marc Demange	Oriented Coloring: Complexity and Approximation.	SOFSEM	2006	DBLP DOI BibTeX RDF
11	Wookey Lee	Hierarchical Web Structuring from the Web as a Graph Approach with Repetitive Cycle Proof.	APWeb Workshops	2006	DBLP DOI BibTeX RDF
11	Susanta Mitra, Aditya Bagchi, A. K. Bandyopadhyay 0001	Complex Queries on Web Graph representing a Social Network.	ICDIM	2006	DBLP DOI BibTeX RDF
11	Hongbo Liu, Jiaxin Wang	A new way to enumerate cycles in graph.	AICT/ICIW	2006	DBLP DOI BibTeX RDF
11	Christopher K. Eveland, Diego A. Socolinsky, Carey E. Priebe, David J. Marchette	A Hierarchical Methodology for Class Detection Problems with Skewed Priors.	J. Classif.	2005	DBLP DOI BibTeX RDF
11	Radhika Ramamurthi, Douglas B. West	Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15, 05C65
11	Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor	Asymmetric k-center is log* n-hard to approximate.	J. ACM	2005	DBLP DOI BibTeX RDF	asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation
11	Nicolas Beldiceanu, Pierre Flener, Xavier Lorca	The tree Constraint.	CPAIOR	2005	DBLP DOI BibTeX RDF
11	Giscard Wepiwé, Plamen L. Simeonov	A Concentric Multi-ring Overlay for Highly Reliable P2P Networks.	NCA	2005	DBLP DOI BibTeX RDF
11	Bernd Gärtner, Walter D. Morris Jr., Leo Rüst	Unique Sink Orientations of Grids.	IPCO	2005	DBLP DOI BibTeX RDF
11	Suk Jai Seo, Peter J. Slater	An introduction to competition-reachability of a graph.	ACM Southeast Regional Conference (1)	2005	DBLP DOI BibTeX RDF	competition parameters, orientations, reachability
11	José João Morais, Nelma Moreira, Rogério Reis	Acyclic Automata with Easy-to-Find Short Regular Expressions.	CIAA	2005	DBLP DOI BibTeX RDF
11	Tim Dwyer, Yehuda Koren	DIG-COLA: Directed Graph Layout through Constrained Energy Minimization.	INFOVIS	2005	DBLP DOI BibTeX RDF