Results 81 to 90 of about 1,353,416 (150)

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes [PDF]

, 2005
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka, Miroslav Chlebík, Chlebik, Miroslav, Miroslav Chlebik (4461319), Janka Chlebíková, Janka Chlebíková (16060964)   +5 more
core  

A new 4-chromatic edge critical Koester graph [PDF]

Discrete Mathematics Letters, 2023
Andrey A. Dobrynin
doaj   +1 more source

Splitting Plane Graphs to Outerplanarity

Journal of Graph Algorithms and Applications
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often planarity, for ...
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu   +2 more
doaj   +1 more source

Action planning for graph transition systems [PDF]

, 2005
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Lluch-Lafuente, Alberto, Jabbar, Shahid, Edelkamp, Stefan, Shahid Jabbar, Baroper Str, Stefan Edelkamp   +5 more
core   +1 more source

Graph Pattern Matching: From Intractable to Polynomial Time [PDF]

, 2010
Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong, Tang, Nan, Ma, Shuai, Fan, Wenfei; id_orcid, Wu, Yunpeng, Wu, Yinghui   +5 more
core  

Distributed Graph Simulation: Impossibility and Possibility [PDF]

, 2014
This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin, Fan, Wenfei; id_orcid, Wu, Yinghui, Deng, Dong   +3 more
core  

Plane embeddings of planar graph metrics

, 2006
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc networks, and molecular reconstruction, we consider the natural problem of ...
Mohammadtaghi Hajiaghayi, et al., Mohammadhossein Bateni   +1 more
core  

The Scaling Limit of Random Two-Connected Series-Parallel Maps. [PDF]

J Theor Probab
Amankwah D, Björnberg J, Stefánsson SÖ, Stufler B, Turunen J.   +4 more
europepmc   +1 more source

Learning Work Function via Implicit Reasoning on Electrostatic Potential Landscapes. [PDF]

Adv Sci (Weinh)
Wan H, Wu Y, Su T, Pan D.
europepmc   +1 more source

Oblique Plane Deformity Correction with Ilizarov Fixator in Ipsilateral Proximal Tibia Growth Arrest and Malunited Tibia: A Case Report. [PDF]

J Orthop Case Rep
Yadav RK, Behera S, Kumar P, Raj M, Pandey RK, Sharma S.   +5 more
europepmc   +1 more source