Search Results - "0102 computer and information sciences"

The n-ary initial literal and literal shuffle

Authors: Stefan Hoffmann

Source: Discrete Applied Mathematics. 376:112-132

Subject Terms: FOS: Computer and information sciences, F.4.3, D.1.3, Computer Science - Distributed, Parallel, and Cluster Computing, Formal Languages and Automata Theory (cs.FL), 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, Distributed, Parallel, and Cluster Computing (cs.DC), 01 natural sciences, 68Q45 (Primary) 68Q85 (Secondary)

Access URL: http://arxiv.org/abs/2108.09282

Monitoring edge-geodetic sets in graphs

Authors: Dev, Subhadeep Dey, Sanjana Foucaud, Florent et al.

Contributors: Dev, Subhadeep Dey, Sanjana Foucaud, Florent et al.

Source: Discrete Applied Mathematics. 377:598-610

Subject Terms: Edge-geodetic set, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Monitoring, Combinatorics, Feedback edge set, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences, NP-completeness

File Description: application/pdf

Access URL: http://arxiv.org/abs/2210.03774

Non-degenerate hypergraphs with exponentially many extremal constructions

Authors: József Balogh Felix Christian Clemen Haoran Luo

Source: Journal of Combinatorial Theory, Series B. 175:1-28

Subject Terms: FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 01 natural sciences

Access URL: http://arxiv.org/abs/2208.00652

Fast algorithms for Vizing's theorem on bounded degree graphs

Authors: Anton Bernshteyn Abhishek Dhawan

Source: Journal of Combinatorial Theory, Series B. 175:69-125

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing, 0102 computer and information sciences, Distributed, Parallel, and Cluster Computing (cs.DC), Combinatorics (math.CO), 01 natural sciences

Access URL: http://arxiv.org/abs/2303.05408

On the structure of Laplacian characteristic polynomial for circulant foliation

Authors: Kwon, Young Soo Mednykh, Alexander Mednykh, Ilya

Source: Discrete Applied Mathematics. 375:338-349

Subject Terms: 05C30, 39A10, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences

Access URL: http://arxiv.org/abs/2111.04297

Stability in Bondy's theorem on paths and cycles

Authors: Bo Ning Long-Tu Yuan

Source: Journal of Combinatorial Theory, Series B. 175:213-239

Subject Terms: Combinatorics, FOS: Mathematics, 0102 computer and information sciences, Combinatorics (math.CO), 01 natural sciences

Access URL: http://arxiv.org/abs/2207.13650

Global and Local Error-Tolerant Decentralized State Estimation Under Partially Ordered Observations

Authors: Dajiang Sun Christoforos N. Hadjicostis Zhiwu Li

Source: IEEE Transactions on Automatic Control. 70:6719-6734

Subject Terms: 0209 industrial biotechnology, FOS: Electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Systems and Control (eess.SY), Electrical Engineering and Systems Science - Systems and Control, 01 natural sciences

Access URL: http://arxiv.org/abs/2401.09110

A polytopal generalization of Apollonian packings and Descartes' theorem

Authors: Alfonsín, Jorge L. Ramírez Rasskin, Iván

Source: Journal of Number Theory. 275:67-103

Subject Terms: FOS: Mathematics, Mathematics - Combinatorics, 51M20, 52C26, 05B40, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences

Access URL: http://arxiv.org/abs/2107.09432

Compositions of digraphs: a survey

Authors: Yuefang Sun

Source: Discrete Applied Mathematics. 373:137-153

Subject Terms: 0211 other engineering and technologies, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences

Access URL: http://arxiv.org/abs/2103.11171

Highly symmetric lines

Authors: Ganzhinov Mikhail Department of Information and Communications Engineering Information Theory et al.

Contributors: Ganzhinov Mikhail Department of Information and Communications Engineering Information Theory et al.

Source: Linear Algebra and its Applications. 722:12-37

Subject Terms: Mathematics - Functional Analysis, Frames, Irreducible representations of finite groups, Line systems, Mathematics - Metric Geometry, FOS: Mathematics, Mathematics - Combinatorics, Metric Geometry (math.MG), 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences, Functional Analysis (math.FA)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2207.08266
https://aaltodoc.aalto.fi/handle/123456789/135858

Parameterized Max Min Feedback Vertex Set

Authors: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

Contributors: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

Source: SIAM Journal on Discrete Mathematics. 39:1587-1620

Subject Terms: FOS: Computer and information sciences, Parameterized algorithms, Computer Science - Computational Complexity, ETH, Treewidth, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), Feedback vertex set, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2302.09604
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.62

Membership problems in finite groups

Authors: Markus Lohrey Andreas Rosowski Georg Zetzsche et al.

Contributors: Markus Lohrey Andreas Rosowski Georg Zetzsche et al.

Source: 47th International Symposium on Mathematical Foundations of Computer Science
Leibniz International Proceedings in Informatics

Subject Terms: algorithms for finite groups, FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), 20B05, 20F10, 68Q45, intersection non-emptiness problems, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, Group Theory (math.GR), 01 natural sciences, FOS: Mathematics, ddc:004, knapsack problems in groups, 0101 mathematics, Mathematics - Group Theory

File Description: application/pdf

Access URL: http://arxiv.org/abs/2206.11756
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.71
http://hdl.handle.net/21.11116/0000-000A-BC99-6
http://hdl.handle.net/21.11116/0000-000B-32E4-B
http://hdl.handle.net/21.11116/0000-000A-BC9B-4

The Price of Hierarchical Clustering

Authors: Arutyunova, Anna Röglin, Heiko Anna Arutyunova and Heiko Röglin

Contributors: Arutyunova, Anna Röglin, Heiko Anna Arutyunova and Heiko Röglin

Source: Algorithmica. 87:1420-1452

Subject Terms: FOS: Computer and information sciences, k-center Problem, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), approximation Algorithms, 0102 computer and information sciences, 02 engineering and technology, ddc:004, Hierarchical Clustering, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2205.01417
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.10

Odd coloring of 2-boundary planar graphs and beyond

Authors: Weichan Liu Mengke Qi Xin Zhang

Source: Discrete Applied Mathematics. 380:68-79

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 05C15, 05C10, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 01 natural sciences, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2205.09317

The degree-restricted random process is far from uniform

Authors: Michael Molloy Erlang Surya Lutz Warnke

Source: Journal of Combinatorial Theory, Series B. 176:111-162

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Combinatorics, Discrete Mathematics, Probability (math.PR), FOS: Mathematics, 05C80, 60C05, 68W20, 60G99, 90B15, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences, Probability

Access URL: http://arxiv.org/abs/2211.00835

Multilayer crisscross error and erasure correction

Authors: Martínez Peñas, Umberto

Source: Linear Algebra and its Applications. 728:349-375

Subject Terms: FOS: Computer and information sciences, Duality, Computer Science - Information Theory, Information Theory (cs.IT), Crisscross error correction, 0202 electrical engineering, electronic engineering, information engineering, Álgebra lineal, Sum-rank distance, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Extremal codes

File Description: application/pdf

Access URL: http://arxiv.org/abs/2203.07238

About the infinite windy firebreak location problem

Authors: Marc Demange Alessia Di Fonso Gabriele Di Stefano et al.

Source: Discrete Applied Mathematics. 378:280-293

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), G.2.2, 0102 computer and information sciences, G.2.3, F.2.2, 15. Life on land, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Discrete Mathematics, 90B80, 68Q25, 90C27, 05C63

Access URL: http://arxiv.org/abs/2204.05475

Complete weight enumerators of a class of linear codes with four or five weights

Authors: Zhang, Xina

Source: Advances in Mathematics of Communications. 20:118-135

Subject Terms: FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/abs/2012.04904

On the independence polynomial and threshold of an antiregular k-hypergraph

Authors: Erchuan Zhang

Source: Discrete Applied Mathematics. 378:244-258

Subject Terms: FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 01 natural sciences

Access URL: http://arxiv.org/abs/2303.01024

Dense minors of graphs with independence number two

Authors: Sergey Norin Paul Seymour

Source: Journal of Combinatorial Theory, Series B. 176:101-110

Subject Terms: FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), 01 natural sciences

Access URL: http://arxiv.org/abs/2206.00186