Finding paths in graphs avoiding forbidden transitions
Discrete Applied Mathematics
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Computational Issues in E-commerce Trading Exchanges
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
Discrete Mathematics
Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs
Journal of Combinatorial Theory Series B
Removing false code dependencies to speedup software build processes
CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
Parametric analysis for adaptive computation offloading
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Minimum average distance of strong orientations of graphs
Discrete Applied Mathematics
Annals of Mathematics and Artificial Intelligence
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
An s-strong tournament with s≥3 has s + 1 vertices whose out-arcs are 4-pancyclic
Discrete Applied Mathematics
Resource bartering in data grids
Scientific Programming
Computers and Electronics in Agriculture
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
Journal of Discrete Algorithms
A highest-label preflow algorithm for the minimum flow problem
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Super-connected and super-arc-connected Cartesian product of digraphs
Information Processing Letters
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Minimum Leaf Out-Branching Problems
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
Computers and Operations Research
Sequential and parallel deficit scaling algorithms for minimum flow in bipartite networks
WSEAS Transactions on Computers
A parallel algorithm for the minimum flow problem in bipartite networks
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Note: On the number of connected convex subgraphs of a connected acyclic digraph
Discrete Applied Mathematics
A dirac-type result on hamilton cycles in oriented graphs
Combinatorics, Probability and Computing
A framework for multi-robot node coverage in sensor networks
Annals of Mathematics and Artificial Intelligence
Optimal strong (κ,d)-orientation of complete k-partite graphs
Discrete Applied Mathematics
On the guessing number of shift graphs
Journal of Discrete Algorithms
Triangle packings and 1-factors in oriented graphs
Journal of Combinatorial Theory Series B
k-strong spanning local tournaments in locally semicomplete digraphs
Discrete Applied Mathematics
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Communication: On complexity of Minimum Leaf Out-Branching problem
Discrete Applied Mathematics
Feasibility of Motion Planning on Directed Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The wave preflow algorithm for the minimum flow problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
The bondage number in complete t-partite digraphs
Information Processing Letters
Expressing Extension-Based Semantics Based on Stratified Minimal Models
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Making Directed Graphs Transitive
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Properly Coloured Cycles and Paths: Results and Open Problems
Graph Theory, Computational Intelligence and Thought
The Graph Programming Language GP
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
BPM '09 Proceedings of the 7th International Conference on Business Process Management
About minimum cost flow problem in networks with node capacities
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Minimum leaf out-branching and related problems
Theoretical Computer Science
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
Disjoint directed and undirected paths and cycles in digraphs
Theoretical Computer Science
About flow problems in networks with node capacities
WSEAS Transactions on Computers
Parameterized complexity of candidate control in elections and related digraph problems
Theoretical Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
European Journal of Combinatorics
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
Applying Testability Transformations to Achieve Structural Coverage of Erlang Programs
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Unilateral Orientation of Mixed Graphs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Communication: Mediated digraphs and quantum nonlocality
Discrete Applied Mathematics
Communication: Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Computational complexity of isothermic DNA sequencing by hybridization
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
On the connectivity of close to regular multipartite tournaments
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Strong orientations of complete k-partite graphs achieving the strong diameter
Information Processing Letters
Finding next-to-shortest paths in a graph
Information Processing Letters
Discrete Applied Mathematics
Three supplements to Reid's theorem in multipartite tournaments
Discrete Applied Mathematics
Directed graphs without short cycles
Combinatorics, Probability and Computing
Cycles of given length in oriented graphs
Journal of Combinatorial Theory Series B
Out-arc pancyclicity of vertices in tournaments
Discrete Applied Mathematics
Double-super-connected digraphs
Discrete Applied Mathematics
Feasibility of motion planning on acyclic and strongly connected directed graphs
Discrete Applied Mathematics
Self-stabilizing group communication in directed networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Hamiltonian degree sequences in digraphs
Journal of Combinatorial Theory Series B
Unifying two graph decompositions with modular decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Better algorithms and bounds for directed maximum leaf problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Minimum cost homomorphisms to reflexive digraphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Paths and trails in edge-colored graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
Journal of Computer and System Sciences
The internet's unexploited path diversity
IEEE Communications Letters
Heuristics for the central tree problem
Journal of Heuristics
Network coding for distributed storage systems
IEEE Transactions on Information Theory
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
The multi-facility median problem with Pos/Neg weights on general graphs
Computers and Operations Research
Solving MINONES-2-SAT as fast as VERTEX COVER
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Directed graph learning via high-order co-linkage analysis
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Turbo NOC: a framework for the design of network-on-chip-based turbo decoder architectures
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences
Practical and efficient approximations of nash equilibria for win-lose games based on graph spectra
WINE'10 Proceedings of the 6th international conference on Internet and network economics
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem
Journal of Artificial Intelligence Research
SIAM Journal on Discrete Mathematics
A Semiexact Degree Condition for Hamilton Cycles in Digraphs
SIAM Journal on Discrete Mathematics
Computer Speech and Language
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Optimally orienting physical networks
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Algorithms and complexity results for persuasive argumentation
Artificial Intelligence
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
Approximation algorithms for orienting mixed graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Mitigating the confounding effects of program dependences for effective fault localization
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Incremental algorithms for the minimum cost flow problem
Proceedings of the 15th WSEAS international conference on Computers
Gallai's Theorem for List Coloring of Digraphs
SIAM Journal on Discrete Mathematics
Tolerance based contract-or-patch heuristic for the asymmetric TSP
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Parameterized Eulerian strong component arc deletion problem on tournaments
Information Processing Letters
The complexity of two graph orientation problems
Discrete Applied Mathematics
On making directed graphs transitive
Journal of Computer and System Sciences
A survey on Hamilton cycles in directed graphs
European Journal of Combinatorics
Decomposing locally semicomplete digraphs into strong spanning subdigraphs
Journal of Combinatorial Theory Series B
On spanning galaxies in digraphs
Discrete Applied Mathematics
A SAT based effective algorithm for the directed hamiltonian cycle problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Upward planarity testing of embedded mixed graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Robustness of minimum cost arborescences
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An algorithm for finding input-output constrained convex sets in an acyclic digraph
Journal of Discrete Algorithms
European Journal of Combinatorics
Arc-disjoint spanning sub(di)graphs in digraphs
Theoretical Computer Science
Efficient total domination in digraphs
Journal of Discrete Algorithms
Discrete Applied Mathematics
Minimum cycle factors in quasi-transitive digraphs
Discrete Optimization
λ'-Optimality of Bipartite Digraphs
Information Processing Letters
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Pancyclic out-arcs of a vertex in oriented graphs
Information Processing Letters
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
A new view on Rural Postman based on Eulerian Extension and Matching
Journal of Discrete Algorithms
A theory for the connectivity discovered by routing protocols
IEEE/ACM Transactions on Networking (TON)
Directed graph-based multi-agent coalitional decision making
Knowledge-Based Systems
QSEA for fuzzy subgraph querying of KEGG pathways
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices
Journal of Graph Theory
Feedback Vertex Sets in Tournaments
Journal of Graph Theory
Secure Minimum-Energy Multicast Tree Based on Trust Mechanism for Cognitive Radio Networks
Wireless Personal Communications: An International Journal
Towards a unified model of outdoor and indoor spaces
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Theoretical Computer Science
From kernels in directed graphs to fixed points and negative cycles in Boolean networks
Discrete Applied Mathematics
Quasi-hamiltonian paths in semicomplete multipartite digraphs
Discrete Applied Mathematics
Constraint expressions and workflow satisfiability
Proceedings of the 18th ACM symposium on Access control models and technologies
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Note: Arc-disjoint paths and trees in 2-regular digraphs
Discrete Applied Mathematics
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Theory of Computing Systems
Discrete Applied Mathematics
A graph distance based metric for data oriented workflow retrieval with variable time constraints
Expert Systems with Applications: An International Journal
Note: Parameterized complexity of k-Chinese Postman Problem
Theoretical Computer Science
The complexity of multicut and mixed multicut problems in (di)graphs
Theoretical Computer Science
Live digital, remember digital: State of the art and research challenges
Computers and Electrical Engineering
An automatic subdigraph renovation plan for failure recovery of composite semantic Web services
Frontiers of Computer Science: Selected Publications from Chinese Universities
Generalized Hybrid Encoding of Polyhierarchical Structures
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.07 |
The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity. Substantially revised, reorganised and updated, the book now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject. Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science. It will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.