Výsledky vyhledávání - "Linear Time Algorithms"

Brooks‐Type Colourings of Digraphs in Linear Time Autor Gonçalves, Daniel, Picasarri‐Arrieta, Lucas, Reinald, Amadeus

“…ABSTRACT Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal…”
Získat plný text

On complementarily transitivity of graphs Autor Santra, Kamal

“…•We show that the Maximum Complementarily Transitivity Decision Problem is NP-complete for chordal graphs and bipartite graphs. We also show that the decision…”
Získat plný text

Solving NP-hard problems on GaTEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets Autor Hellmuth, Marc, Scholz, Guillaume E.

“…The class of Galled-Tree Explainable (GaTEx) graphs has recently been discovered as a natural generalization of cographs. Cographs are precisely those graphs…”
Získat plný text

Nearly-Linear Time Seeded Extractors With Short Seeds Autor Doron, Dean, Ribeiro, Joao

“…Seeded extractors are fundamental objects in pseudorandomness and cryptography, and a deep line of work has designed polynomial-time seeded extractors with…”
Získat plný text

Fast rule-based graph programs Autor Campbell, Graham, Courtehoute, Brian, Plump, Detlef

“…•Rooted rules are essential for fast rule-based graph algorithms.•Cycle graphs, trees, binary DAGs can be recognised by graph reduction in linear…”
Získat plný text

New sharp lower bound for the quorum coloring number of trees Autor Sahbi, Rafik

“…•The alliance partition number of a tree has a new sharp lower bound computable in linear time.•This new lower bound is better than all those that have been…”
Získat plný text

Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees Autor Sahbi, Rafik, Boumalha, Wissam, Issad, Asmaa

“…A partition π = { V 1 , V 2 , …, V k } of the vertex set V of a graph G into k color classes V i , with 1 ≤ i ≤ k is called a quorum coloring of G if for every…”
Získat plný text

The Power of Linear-Time Data Reduction for Maximum Matching Autor Mertzios, George B., Nichterlein, André, Niedermeier, Rolf

“…Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph primitives. For m -edge and n -vertex graphs, it is…”
Získat plný text

New Structures and Algorithms for Length-Constrained Expander Decompositions Autor Haeupler, Bernhard, Hershkowitz, D Ellis, Tan, Zihan

“…Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander…”
Získat plný text

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut Autor Cheng, Yu, Li, Max, Lin, Honghao, Tai, Zi-Yi, Woodruff, David P, Zhang, Jason

“…In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to…”
Zjistit podrobnosti o přístupu

Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time Autor Didimo, Walter, Kaufmann, Michael, Liotta, Giuseppe, Ortali, Giacomo

“…A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G…”
Získat plný text

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy Autor Jiang, Zihan, Mao, Fubing, Guo, Yapu, Liu, Xu, Liu, Haikun, Liao, Xiaofei, Jin, Hai, Zhang, Wei

“…Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of…”
Získat plný text

Subspace exploration: Bounds on Projected Frequency Estimation Autor Cormode, Graham, Dickens, Charlie, Woodruff, David P

“…Given an n × d dimensional dataset A, a projection query specifies a subset C ⊆ [d] of columns which yields a new n × |C| array. We study the space complexity…”
Zjistit podrobnosti o přístupu

Folding Every Point on a Polygon Boundary to a Point Autor Phetmak, Nattawut, Fakcharoenphol, Jittat

“…We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of…”
Získat plný text

Decremental optimization of vertex-colouring under the reconfiguration framework Autor Yanagisawa, Yusuke, Suzuki, Akira, Tamura, Yuma, Zhou, Xiao

“…Suppose that we are given a positive integer k, and a k-(vertex-)colouring of a given graph G. Then we are asked to find a colouring of G using the minimum…”
Získat plný text

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts Autor Etscheid, Michael, Mnich, Matthias

“…The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be…”
Získat plný text

A linear time algorithm for maximal clique enumeration in large sparse graphs Autor Yu, Ting, Liu, Mengchi

“…A maximal clique is one of the most fundamental dense substructures in an undirected graph, and maximal clique enumeration (MCE) plays an essential role in…”
Získat plný text

A linear-time algorithm for broadcast domination in a tree Autor Dabney, John, Dean, Brian C., Hedetniemi, Stephen T.

“…The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power p at vertex v is capable of…”
Získat plný text

Structured Watermarks for Structured Software Autor Bento, Lucila M. S., Boccardo, Davidson R., Machado, Raphael C. S., Pereira de Sá, Vinícius G., Szwarcfiter, Jayme L.

“…Software watermarking involves integrating an identifier within the software, enabling timely retrieval to disclose authorship/ownership, and deter piracy…”
Získat plný text

Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes Autor Das, Bireswar, Sharma, Shivdutt

“…The isomorphism problem for groups, when the groups are given by their Cayley tables is a well-studied problem. This problem has been studied for various…”
Získat plný text