Search Results - "semicomplete digraph"

Edge‐arc‐disjoint paths in semicomplete mixed graphs

Authors: J. Bang‐Jensen Y. Wang

Source: Journal of Graph Theory. 108:705-721

Subject Terms: arc-disjoint path, weak linkage, 0102 computer and information sciences, mixed graph, 0101 mathematics, semicomplete digraph, 01 natural sciences, orientation

Strong arc decompositions of split digraphs

Authors: Jørgen Bang‐Jensen Yun Wang

Source: Journal of Graph Theory. 108:5-26

Subject Terms: branchings, strong arc decomposition, 0211 other engineering and technologies, split digraph, 0102 computer and information sciences, 02 engineering and technology, semicomplete digraph, 01 natural sciences

Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs

Authors: J. Bang‐Jensen Y. Wang

Source: Journal of Graph Theory. 106:182-197

Subject Terms: arc-disjoint subdigraphs, in-branchings, FOS: Mathematics, Mathematics - Combinatorics, out-branchings, polynomial algorithm, 0102 computer and information sciences, Combinatorics (math.CO), 05C20, 05C38, 05C40, 05C85, semicomplete digraph, 01 natural sciences

Access URL: http://arxiv.org/abs/2302.06177
https://portal.findresearcher.sdu.dk/da/publications/7fbe65f8-eca3-4886-996b-a1f3f9c652ea
https://doi.org/10.1002/jgt.23072

Making a tournament k $k$‐strong

Authors: Jørgen Bang‐Jensen Kasper S. Johansen Anders Yeo

Source: Bang-Jensen, J, Johansen, K S & Yeo, A 2023, ' Making a tournament k-strong ', Journal of Graph Theory, vol. 103, no. 1, pp. 5-11 . https://doi.org/10.1002/jgt.22900

Subject Terms: Semicomplete digraph, Directed vertex-connectivity augmentation, directed vertex-connectivity augmentation, One-way pairs, one-way pairs, increasing connectivity, 0102 computer and information sciences, semicomplete digraph, Increasing connectivity, Tournament, 01 natural sciences, tournament

File Description: application/pdf

Access URL: https://orbit.dtu.dk/en/publications/e7a6ce88-db15-46cf-b4d6-d29c5b31ba09
https://portal.findresearcher.sdu.dk/da/publications/3efd6bbd-43c7-4172-8470-39227bd099e6
https://doi.org/10.1002/jgt.22900

Spanning eulerian subdigraphs in semicomplete digraphs

Authors: Bang-Jensen, Jørgen Havet, Frédéric Yeo, Anders et al.

Contributors: Bang-Jensen, Jørgen Havet, Frédéric Yeo, Anders et al.

Source: Journal of Graph Theory. 102:578-606

Subject Terms: Semicomplete digraph, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), polynomial algorithm, 0102 computer and information sciences, semicomplete digraph, 01 natural sciences, tournament, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Eulerian subdigraph, FOS: Mathematics, Mathematics - Combinatorics, arc-connectivity, Combinatorics (math.CO), Tournament, eulerian subdigraph, Arc-connectivity, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/1905.11019
https://inria.hal.science/hal-03844943v1/document
https://inria.hal.science/hal-03844943v1
https://doi.org/10.1002/jgt.22779
https://portal.findresearcher.sdu.dk/da/publications/3238d41c-8cca-46f3-aa66-c5379237cdbd
https://doi.org/10.1002/jgt.22888

Directed Steiner tree packing and directed tree connectivity

Authors: Yuefang Sun Anders Yeo

Source: Journal of Graph Theory. 102:86-106

Subject Terms: directed k-linkage, directed Steiner tree packing, Eulerian digraph, FOS: Mathematics, Mathematics - Combinatorics, out-tree, Combinatorics (math.CO), 0102 computer and information sciences, symmetric digraph, directed tree connectivity, semicomplete digraph, 01 natural sciences

Access URL: http://arxiv.org/abs/2005.00849
https://portal.findresearcher.sdu.dk/da/publications/48916a67-a2cd-4f62-b764-f1a2a07beda1
https://doi.org/10.1002/jgt.22858

A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs

Authors: Madathil, Jayakrishnan Sharma, Roohani Zehavi, Meirav et al.

Contributors: Madathil, Jayakrishnan Sharma, Roohani Zehavi, Meirav et al.

Source: Algorithmica. 83:1861-1884

Subject Terms: bisection, polynomial kernel, splitters, 0102 computer and information sciences, ddc:004, fpt algorithm, chromatic coding, semicomplete digraph, 01 natural sciences, tournament

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2019/10972/pdf/LIPIcs-MFCS-2019-28.pdf
https://repository.iitgn.ac.in/handle/123456789/6334
https://link.springer.com/article/10.1007/s00453-021-00806-x
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#MadathilSZ21
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3293156
https://link.springer.com/content/pdf/10.1007/s00453-021-00806-x.pdf
https://doi.org/10.1007/s00453-021-00806-x
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.28

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties

Authors: Anders Yeo Frédéric Havet Joergen Bang-Jensen et al.

Contributors: Anders Yeo Frédéric Havet Joergen Bang-Jensen et al.

Source: Bang-Jensen, J, Havet, F, Kriesell, M & Yeo, A 2022, ' Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ', Journal of Graph Theory, vol. 99, no. 4, pp. 615-636 . https://doi.org/10.1002/jgt.22755

Subject Terms: strong connectivity, 0102 computer and information sciences, semicomplete digraph, 01 natural sciences, 05C20, 05C15, edge-disjoint spanning trees, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], bipartite graph, FOS: Mathematics, Mathematics - Combinatorics, arc-connectivity, Combinatorics (math.CO), majority colouring, 0101 mathematics, edge-connectivity

Access URL: http://arxiv.org/pdf/2008.05272
http://arxiv.org/abs/2008.05272
https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22755
https://portal.findresearcher.sdu.dk/en/publications/low-chromatic-spanning-subdigraphs-with-prescribed-degree-or-conn
https://portal.findresearcher.sdu.dk/da/publications/36a921dd-0e16-43c0-8baa-5725ab820e0a
https://doi.org/10.1002/jgt.22755
https://portal.findresearcher.sdu.dk/da/publications/36a921dd-0e16-43c0-8baa-5725ab820e0a

Arc‐disjoint strong spanning subdigraphs of semicomplete compositions

Authors: Jørgen Bang‐Jensen Gregory Gutin Anders Yeo

Source: Bang-Jensen, J, Gutin, G & Yeo, A 2020, ' Arc-disjoint strong spanning subdigraphs of semicomplete compositions ', Journal of Graph Theory, vol. 95, no. 2, pp. 267-289 . https://doi.org/10.1002/jgt.22568

Subject Terms: decomposition into strong spanning subdigraphs, digraph composition, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), strong spanning subdigraph, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, semicomplete digraph, 01 natural sciences, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: https://findresearcher.sdu.dk:8443/ws/files/170405299/jgt.22568.pdf
http://arxiv.org/abs/1903.12225
https://portal.findresearcher.sdu.dk/en/publications/arc-disjoint-strong-spanning-subdigraphs-of-semicomplete-composit
https://arxiv.org/abs/1903.12225
https://dblp.uni-trier.de/db/journals/corr/corr1903.html#abs-1903-12225
http://dblp.uni-trier.de/db/journals/corr/corr1903.html#abs-1903-12225
https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22568

Degree constrained 2-partitions of semicomplete digraphs

Authors: Bang-Jensen, Jørgen Christiansen, Tilde My

Source: Bang-Jensen, J & Christiansen, T M 2018, ' Degree constrained 2-partitions of semicomplete digraphs ', Theoretical Computer Science, vol. 746, pp. 112-123 . https://doi.org/10.1016/j.tcs.2018.06.028

Subject Terms: Semicomplete digraph, Minimum out-degree, 2-partition, Digraphs of bounded independence number, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Minimum in-degree, Tournament, 01 natural sciences, Minimum semi-degree, NP-complete

File Description: application/pdf

Access URL: https://findresearcher.sdu.dk:8443/ws/files/143341866/Degree_constrained_2_partitions_of_semicomplete_digraphs.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs746.html#Bang-JensenC18
https://www.sciencedirect.com/science/article/abs/pii/S0304397518304444

Finding good 2-partitions of digraphs I. Hereditary properties

Authors: Bang-Jensen, Jørgen Havet, Frédéric Havet, Frederic

Contributors: Bang-Jensen, Jørgen Havet, Frédéric Havet, Frederic

Source: Bang-Jensen, J & Havet, F 2016, ' Finding good 2-partitions of digraphs I. Hereditary properties ', Theoretical Computer Science, vol. 636, no. C, pp. 85-94 . https://doi.org/10.1016/j.tcs.2016.05.029

Subject Terms: polynomial, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Out-branching, Polynomial, semicomplete digraph, 01 natural sciences, out-branching, splitting digraphs, Feedback vertex set, Acyclic, minimum degree, NP-complete, Semicomplete digraph, oriented, 2-partition, acyclic, Oriented, feedback vertex set, partition, tournament, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Minimum degree, Splitting digraphs, Tournament, Partition

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01327015/document
https://www.sciencedirect.com/science/article/pii/S0304397516301657
https://dblp.uni-trier.de/db/journals/tcs/tcs636.html#Bang-JensenH16
https://hal.inria.fr/hal-01279332
http://findresearcher.sdu.dk/portal/en/publications/finding-good-2partitions-of-digraphs-i-hereditary-properties(73b657c3-d3b4-4a34-805d-dd14824b7776).html
https://hal.archives-ouvertes.fr/hal-01327015
https://portal.findresearcher.sdu.dk/da/publications/73b657c3-d3b4-4a34-805d-dd14824b7776
https://portal.findresearcher.sdu.dk/da/publications/73b657c3-d3b4-4a34-805d-dd14824b7776
https://doi.org/10.1016/j.tcs.2016.05.029

A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs

Authors: Madathil, Jayakrishnan Sharma, Roohani Zehavi, Meirav et al.

Contributors: Madathil, Jayakrishnan Sharma, Roohani Zehavi, Meirav et al.

Subject Terms: bisection, semicomplete digraph, tournament, fpt algorithm, chromatic coding, polynomial kernel, splitters

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.28

Availability: https://doi.org/10.4230/LIPIcs.MFCS.2019.28
https://nbn-resolving.org/urn:nbn:de:0030-drops-109721
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.28

Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs

Authors: Li Ruijuan Han Tingting

Source: Discussiones Mathematicae Graph Theory, Vol 38, Iss 2, Pp 477-490 (2018)

Subject Terms: locally semicomplete digraph, local tournament, round decomposable, arc-disjoint, hamiltonian cycle, hamiltonian path, 05c20, Mathematics, QA1-939

File Description: electronic resource

Relation: https://doaj.org/toc/2083-5892

Access URL: https://doaj.org/article/619eb986aab84c30bd6e2269616c4656

Spanning eulerian subdigraphs in semicomplete digraphs

Authors: Havet, Frédéric Bang-Jensen, Jørgen Yeo, Anders et al.

Contributors: Havet, Frédéric Bang-Jensen, Jørgen Yeo, Anders et al.

Source: https://inria.hal.science/hal-03472923 ; [Research Report] Inria; CNRS; I3S; Université côte d'azur. 2021.

Subject Terms: polynomial algorithm, Semicomplete digraph, Tournament, Eulerian subdigraph, Arc-connectivity, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Availability: https://inria.hal.science/hal-03472923
https://inria.hal.science/hal-03472923v1/document
https://inria.hal.science/hal-03472923v1/file/supereulerian-revise.pdf

Disjoint Paths in Decomposable Digraphs

Authors: Bang-Jensen, Jørgen Christiansen, Tilde My Maddaloni, Alessandro

Source: Bang-Jensen, J, Christiansen, T M & Maddaloni, A 2017, ' Disjoint paths in decomposable digraphs ', Journal of Graph Theory, vol. 85, no. 2, pp. 545-567 . https://doi.org/10.1002/jgt.22090

Subject Terms: disjoint paths, k-linkage problem, quasi-transitive digraph, polynomial algorithm, 0102 computer and information sciences, (round-)decomposable digraphs, locally semicomplete digraph, 01 natural sciences

Access URL: https://portal.findresearcher.sdu.dk/da/publications/993feb05-2974-4b25-a9e2-8b278a99554b
https://portal.findresearcher.sdu.dk/da/publications/993feb05-2974-4b25-a9e2-8b278a99554b
https://doi.org/10.1002/jgt.22090

Finding good 2-partitions of digraphs II. Enumerable properties

Authors: Bang-Jensen, Jørgen Cohen, Nathann Havet, Frédéric

Contributors: Bang-Jensen, Jørgen Cohen, Nathann Havet, Frédéric

Source: Bang-Jensen, J, Cohen, N & Havet, F 2016, ' Finding good 2-partitions of digraphs II. Enumerable properties ', Theoretical Computer Science, vol. 640, pp. 1-19 . https://doi.org/10.1016/j.tcs.2016.05.034

Subject Terms: Semicomplete digraph, 0211 other engineering and technologies, Oriented, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Out-branching, Polynomial, 01 natural sciences, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], 2-Partition, Minimum degree, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Tournament, Feedback vertex set, Splitting digraphs, Acyclic, Partition, NP-complete

File Description: application/pdf

Access URL: https://www.sciencedirect.com/science/article/pii/S0304397516301815
https://dblp.uni-trier.de/db/journals/tcs/tcs640.html#Bang-JensenCH16
https://hal.archives-ouvertes.fr/hal-01346079
https://hal.inria.fr/hal-01279338
https://hal.archives-ouvertes.fr/hal-01346079/document
https://hal.inria.fr/hal-01279338/document
https://portal.findresearcher.sdu.dk/da/publications/d35f3f3c-e4dc-43c9-9237-62a0f13a963b

k-strong spanning local tournaments in locally semicomplete digraphs

Authors: Jørgen Bang-Jensen

Source: Discrete Applied Mathematics. 157:2536-2540

Subject Terms: Semicomplete digraph, Connectivity in digraphs, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Local tournament, Locally semicomplete digraph, Tournament, 01 natural sciences

Access URL: https://dblp.uni-trier.de/db/journals/dam/dam157.html#Bang-Jensen09
https://www.sciencedirect.com/science/article/pii/S0166218X09001103

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments

Authors: Jørgen Bang-Jensen Alessandro Maddaloni Saket Saurabh

Source: Bang-Jensen, J, Maddaloni, A & Saurabh, S 2016, ' Algorithms and kernels for feedback set problems in generalizations of tournaments ', Algorithmica, vol. 76, no. 2, pp. 320-343 . https://doi.org/10.1007/s00453-015-0038-2
Algorithmica

Subject Terms: Parameterized complexity, Feedback arc set, Kernels, Quasi-transitive digraph, 0102 computer and information sciences, Bounded independence number, 16. Peace & justice, Decomposable digraph, Feedback vertex set, Locally semicomplete digraph, 01 natural sciences

Access URL: https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica76.html#Bang-JensenMS16
http://repository.ias.ac.in/123422/
https://dl.acm.org/doi/10.1007/s00453-015-0038-2
http://findresearcher.sdu.dk/portal/da/publications/algorithms-and-kernels-for-feedback-set-problems-in-generalizations-of-tournaments(2f1aabfa-986d-45bb-99c1-eb39ec61fad2).html
https://link.springer.com/article/10.1007%2Fs00453-015-0038-2
https://doi.org/10.1007/s00453-015-0038-2
https://portal.findresearcher.sdu.dk/da/publications/2f1aabfa-986d-45bb-99c1-eb39ec61fad2

Longest path partitions in generalizations of tournaments

Authors: Bang-Jensen, Jørgen Nielsen, Morten Hegner Yeo, Anders

Source: Bang-Jensen, J, Nielsen, M H & Yeo, A 2006, ' Longest path partitions in generalizations of tournaments ', Discrete Mathematics, vol. 306, no. 16, pp. 1830-1839 . https://doi.org/10.1016/j.disc.2006.03.063

Subject Terms: Locally in-semicomplete digraph, Quasi-transitive digraph, Discrete Mathematics and Combinatorics, Longest path, Path partition conjecture, Extended semicomplete digraph, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Theoretical Computer Science

Access URL: https://www.sciencedirect.com/science/article/abs/pii/S0012365X06002536
https://core.ac.uk/display/82444249
https://www.sciencedirect.com/science/article/pii/S0012365X06002536
https://www.sciencedirect.com/science/article/pii/S0012365X06002536#!
https://dblp.uni-trier.de/db/journals/dm/dm306.html#Bang-JensenNY06
https://portal.findresearcher.sdu.dk/da/publications/b5a25440-df6f-11db-9628-000ea68e967b

Finding complementary cycles in locally semicomplete digraphs

Authors: Bang-Jensen, Jørgen Nielsen, Morten Hegner

Source: Bang-Jensen, J & Nielsen, M H 2005, ' Finding complementary cycles in locally semicomplete digraphs ', Discrete Applied Mathematics, vol. 146, pp. 245-256 . https://doi.org/10.1016/j.dam.2004.10.002

Subject Terms: Semicomplete digraph, Applied Mathematics, Polynomial algorithm, 0211 other engineering and technologies, Directed graphs (digraphs), tournaments, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph theory (including graph drawing) in computer science, Complementary cycles, 2-Cycle factor, Discrete Mathematics and Combinatorics, Paths and cycles, Locally semicomplete digraph

File Description: application/xml

Access URL: https://zbmath.org/2136335
https://doi.org/10.1016/j.dam.2004.10.002
https://core.ac.uk/display/82452721
https://dblp.uni-trier.de/db/journals/dam/dam146.html#Bang-JensenN05
https://www.sciencedirect.com/science/article/pii/S0166218X04003506
https://www.sciencedirect.com/science/article/abs/pii/S0166218X04003506
https://portal.findresearcher.sdu.dk/da/publications/44582030-e0ff-11db-9628-000ea68e967b