1101 search results - page 124 / 221 » An Algorithm for the Graph Crossing Number Problem |
139
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
144
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
163
click to vote
NETWORKS
2010
15 years 3 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
162
click to vote
SECON
2007
IEEE
15 years 11 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
164
click to vote
MOBICOM
2005
ACM
15 years 10 months ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...